/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:20:58,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:20:58,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:20:58,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:20:58,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:20:58,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:20:58,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:20:58,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:20:58,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:20:58,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:20:58,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:20:58,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:20:58,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:20:58,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:20:58,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:20:58,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:20:58,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:20:58,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:20:58,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:20:58,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:20:58,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:20:58,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:20:58,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:20:58,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:20:58,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:20:58,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:20:58,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:20:58,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:20:58,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:20:58,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:20:58,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:20:58,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:20:58,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:20:58,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:20:58,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:20:58,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:20:58,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:20:58,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:20:58,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:20:58,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:20:58,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:20:58,926 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-SemanticLbe.epf [2022-12-12 14:20:58,950 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:20:58,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:20:58,951 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:20:58,951 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:20:58,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:20:58,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:20:58,952 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:20:58,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:20:58,953 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:20:58,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:20:58,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:20:58,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:20:58,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:20:58,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:20:58,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:20:58,954 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:20:58,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:20:58,954 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:20:58,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:20:58,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:20:58,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:20:58,954 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:20:58,954 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:20:58,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:20:58,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:20:58,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:20:58,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:20:58,955 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:20:58,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:20:58,955 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:20:58,955 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-12 14:20:59,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:20:59,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:20:59,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:20:59,202 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:20:59,202 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:20:59,203 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2022-12-12 14:21:00,108 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:21:00,339 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:21:00,340 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-12-12 14:21:00,368 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f3e8472e/9cca5ef1ed3b4f58ad89e89504a9b97e/FLAG6e0ab6eae [2022-12-12 14:21:00,380 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f3e8472e/9cca5ef1ed3b4f58ad89e89504a9b97e [2022-12-12 14:21:00,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:21:00,383 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:21:00,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:21:00,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:21:00,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:21:00,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:21:00" (1/1) ... [2022-12-12 14:21:00,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@236aa318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:21:00, skipping insertion in model container [2022-12-12 14:21:00,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:21:00" (1/1) ... [2022-12-12 14:21:00,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:21:00,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:21:00,747 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2022-12-12 14:21:00,754 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2022-12-12 14:21:00,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:21:00,770 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:21:00,802 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2022-12-12 14:21:00,805 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2022-12-12 14:21:00,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:21:00,847 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:21:00,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:21:00 WrapperNode [2022-12-12 14:21:00,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:21:00,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:21:00,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:21:00,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:21:00,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:21:00" (1/1) ... [2022-12-12 14:21:00,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:21:00" (1/1) ... [2022-12-12 14:21:00,889 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-12-12 14:21:00,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:21:00,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:21:00,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:21:00,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:21:00,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:21:00" (1/1) ... [2022-12-12 14:21:00,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:21:00" (1/1) ... [2022-12-12 14:21:00,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:21:00" (1/1) ... [2022-12-12 14:21:00,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:21:00" (1/1) ... [2022-12-12 14:21:00,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:21:00" (1/1) ... [2022-12-12 14:21:00,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:21:00" (1/1) ... [2022-12-12 14:21:00,930 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:21:00" (1/1) ... [2022-12-12 14:21:00,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:21:00" (1/1) ... [2022-12-12 14:21:00,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:21:00,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:21:00,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:21:00,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:21:00,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:21:00" (1/1) ... [2022-12-12 14:21:00,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:21:00,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:21:00,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 14:21:00,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 14:21:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-12 14:21:01,029 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-12 14:21:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-12 14:21:01,029 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-12 14:21:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:21:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:21:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 14:21:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:21:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-12 14:21:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:21:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:21:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:21:01,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:21:01,031 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 14:21:01,199 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:21:01,200 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:21:01,464 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:21:01,471 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:21:01,471 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-12 14:21:01,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:21:01 BoogieIcfgContainer [2022-12-12 14:21:01,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:21:01,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:21:01,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:21:01,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:21:01,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:21:00" (1/3) ... [2022-12-12 14:21:01,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfb080c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:21:01, skipping insertion in model container [2022-12-12 14:21:01,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:21:00" (2/3) ... [2022-12-12 14:21:01,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfb080c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:21:01, skipping insertion in model container [2022-12-12 14:21:01,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:21:01" (3/3) ... [2022-12-12 14:21:01,479 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-12-12 14:21:01,492 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:21:01,492 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:21:01,492 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:21:01,561 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 14:21:01,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 215 transitions, 446 flow [2022-12-12 14:21:01,651 INFO L130 PetriNetUnfolder]: 13/213 cut-off events. [2022-12-12 14:21:01,652 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 14:21:01,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 213 events. 13/213 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 357 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2022-12-12 14:21:01,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 215 transitions, 446 flow [2022-12-12 14:21:01,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 204 transitions, 417 flow [2022-12-12 14:21:01,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:21:01,675 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 204 transitions, 417 flow [2022-12-12 14:21:01,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 204 transitions, 417 flow [2022-12-12 14:21:01,707 INFO L130 PetriNetUnfolder]: 13/204 cut-off events. [2022-12-12 14:21:01,708 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-12 14:21:01,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 204 events. 13/204 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/189 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2022-12-12 14:21:01,715 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 204 transitions, 417 flow [2022-12-12 14:21:01,715 INFO L226 LiptonReduction]: Number of co-enabled transitions 9810 [2022-12-12 14:21:10,052 INFO L241 LiptonReduction]: Total number of compositions: 167 [2022-12-12 14:21:10,063 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:21:10,067 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;@6d4c30e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:21:10,068 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 14:21:10,069 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-12 14:21:10,069 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:21:10,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:21:10,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1] [2022-12-12 14:21:10,070 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:21:10,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:21:10,073 INFO L85 PathProgramCache]: Analyzing trace with hash 880, now seen corresponding path program 1 times [2022-12-12 14:21:10,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:21:10,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743689965] [2022-12-12 14:21:10,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:21:10,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:21:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:21:10,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:21:10,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:21:10,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743689965] [2022-12-12 14:21:10,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743689965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:21:10,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:21:10,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-12 14:21:10,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901148330] [2022-12-12 14:21:10,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:21:10,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-12 14:21:10,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:21:10,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-12 14:21:10,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-12 14:21:10,196 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 82 [2022-12-12 14:21:10,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 173 flow. Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:10,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:21:10,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 82 [2022-12-12 14:21:10,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:21:10,600 INFO L130 PetriNetUnfolder]: 3558/5821 cut-off events. [2022-12-12 14:21:10,600 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-12 14:21:10,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11288 conditions, 5821 events. 3558/5821 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 33901 event pairs, 2900 based on Foata normal form. 0/3129 useless extension candidates. Maximal degree in co-relation 11124. Up to 5369 conditions per place. [2022-12-12 14:21:10,626 INFO L137 encePairwiseOnDemand]: 80/82 looper letters, 65 selfloop transitions, 0 changer transitions 0/80 dead transitions. [2022-12-12 14:21:10,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 299 flow [2022-12-12 14:21:10,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-12 14:21:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-12 14:21:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-12-12 14:21:10,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2022-12-12 14:21:10,639 INFO L175 Difference]: Start difference. First operand has 81 places, 82 transitions, 173 flow. Second operand 2 states and 97 transitions. [2022-12-12 14:21:10,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 299 flow [2022-12-12 14:21:10,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 80 transitions, 294 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-12 14:21:10,645 INFO L231 Difference]: Finished difference. Result has 78 places, 80 transitions, 164 flow [2022-12-12 14:21:10,646 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=164, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2022-12-12 14:21:10,649 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, -3 predicate places. [2022-12-12 14:21:10,649 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 164 flow [2022-12-12 14:21:10,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:10,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:21:10,649 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:21:10,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:21:10,650 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:21:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:21:10,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1562134785, now seen corresponding path program 1 times [2022-12-12 14:21:10,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:21:10,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261307244] [2022-12-12 14:21:10,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:21:10,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:21:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:21:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:21:10,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:21:10,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261307244] [2022-12-12 14:21:10,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261307244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:21:10,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:21:10,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:21:10,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76584274] [2022-12-12 14:21:10,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:21:10,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:21:10,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:21:10,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:21:10,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:21:10,880 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 82 [2022-12-12 14:21:10,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:10,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:21:10,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 82 [2022-12-12 14:21:10,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:21:11,050 INFO L130 PetriNetUnfolder]: 1015/1864 cut-off events. [2022-12-12 14:21:11,050 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-12 14:21:11,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3690 conditions, 1864 events. 1015/1864 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10148 event pairs, 820 based on Foata normal form. 119/1151 useless extension candidates. Maximal degree in co-relation 3687. Up to 1342 conditions per place. [2022-12-12 14:21:11,054 INFO L137 encePairwiseOnDemand]: 78/82 looper letters, 38 selfloop transitions, 2 changer transitions 38/91 dead transitions. [2022-12-12 14:21:11,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 91 transitions, 343 flow [2022-12-12 14:21:11,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:21:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:21:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2022-12-12 14:21:11,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2022-12-12 14:21:11,056 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 164 flow. Second operand 3 states and 120 transitions. [2022-12-12 14:21:11,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 91 transitions, 343 flow [2022-12-12 14:21:11,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 91 transitions, 343 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-12 14:21:11,059 INFO L231 Difference]: Finished difference. Result has 81 places, 48 transitions, 108 flow [2022-12-12 14:21:11,060 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=81, PETRI_TRANSITIONS=48} [2022-12-12 14:21:11,060 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 0 predicate places. [2022-12-12 14:21:11,060 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 48 transitions, 108 flow [2022-12-12 14:21:11,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:11,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:21:11,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:21:11,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:21:11,061 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:21:11,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:21:11,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1256220703, now seen corresponding path program 1 times [2022-12-12 14:21:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:21:11,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126325653] [2022-12-12 14:21:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:21:11,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:21:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:21:11,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:21:11,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:21:11,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126325653] [2022-12-12 14:21:11,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126325653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:21:11,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:21:11,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:21:11,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320475115] [2022-12-12 14:21:11,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:21:11,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:21:11,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:21:11,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:21:11,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:21:11,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 82 [2022-12-12 14:21:11,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:11,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:21:11,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 82 [2022-12-12 14:21:11,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:21:11,257 INFO L130 PetriNetUnfolder]: 363/772 cut-off events. [2022-12-12 14:21:11,257 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-12 14:21:11,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 772 events. 363/772 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3383 event pairs, 243 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 1469. Up to 504 conditions per place. [2022-12-12 14:21:11,261 INFO L137 encePairwiseOnDemand]: 79/82 looper letters, 44 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2022-12-12 14:21:11,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 232 flow [2022-12-12 14:21:11,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:21:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:21:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-12-12 14:21:11,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3699186991869919 [2022-12-12 14:21:11,264 INFO L175 Difference]: Start difference. First operand has 81 places, 48 transitions, 108 flow. Second operand 3 states and 91 transitions. [2022-12-12 14:21:11,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 232 flow [2022-12-12 14:21:11,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:21:11,266 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 114 flow [2022-12-12 14:21:11,267 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2022-12-12 14:21:11,268 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, -29 predicate places. [2022-12-12 14:21:11,268 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 114 flow [2022-12-12 14:21:11,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:11,268 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:21:11,268 INFO L214 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] [2022-12-12 14:21:11,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:21:11,268 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:21:11,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:21:11,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1222990673, now seen corresponding path program 1 times [2022-12-12 14:21:11,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:21:11,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869228593] [2022-12-12 14:21:11,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:21:11,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:21:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:21:11,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:21:11,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:21:11,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869228593] [2022-12-12 14:21:11,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869228593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:21:11,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:21:11,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:21:11,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495654622] [2022-12-12 14:21:11,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:21:11,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:21:11,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:21:11,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:21:11,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:21:11,441 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 82 [2022-12-12 14:21:11,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:11,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:21:11,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 82 [2022-12-12 14:21:11,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:21:11,531 INFO L130 PetriNetUnfolder]: 206/516 cut-off events. [2022-12-12 14:21:11,531 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-12 14:21:11,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 516 events. 206/516 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2265 event pairs, 12 based on Foata normal form. 45/456 useless extension candidates. Maximal degree in co-relation 1017. Up to 388 conditions per place. [2022-12-12 14:21:11,533 INFO L137 encePairwiseOnDemand]: 77/82 looper letters, 37 selfloop transitions, 5 changer transitions 1/54 dead transitions. [2022-12-12 14:21:11,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 54 transitions, 213 flow [2022-12-12 14:21:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:21:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:21:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-12-12 14:21:11,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34552845528455284 [2022-12-12 14:21:11,535 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 114 flow. Second operand 3 states and 85 transitions. [2022-12-12 14:21:11,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 54 transitions, 213 flow [2022-12-12 14:21:11,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:21:11,537 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 120 flow [2022-12-12 14:21:11,538 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2022-12-12 14:21:11,539 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, -29 predicate places. [2022-12-12 14:21:11,539 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 120 flow [2022-12-12 14:21:11,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:11,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:21:11,539 INFO L214 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] [2022-12-12 14:21:11,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:21:11,539 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:21:11,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:21:11,540 INFO L85 PathProgramCache]: Analyzing trace with hash -396061117, now seen corresponding path program 1 times [2022-12-12 14:21:11,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:21:11,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047238872] [2022-12-12 14:21:11,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:21:11,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:21:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:21:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:21:11,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:21:11,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047238872] [2022-12-12 14:21:11,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047238872] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 14:21:11,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468656468] [2022-12-12 14:21:11,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:21:11,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 14:21:11,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:21:11,612 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 14:21:11,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-12 14:21:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:21:11,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-12 14:21:11,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 14:21:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:21:11,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 14:21:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:21:11,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468656468] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 14:21:11,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 14:21:11,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-12 14:21:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797567040] [2022-12-12 14:21:11,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 14:21:11,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:21:11,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:21:11,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:21:11,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:21:11,793 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 82 [2022-12-12 14:21:11,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 120 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:11,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:21:11,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 82 [2022-12-12 14:21:11,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:21:11,931 INFO L130 PetriNetUnfolder]: 264/699 cut-off events. [2022-12-12 14:21:11,931 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-12 14:21:11,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 699 events. 264/699 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2745 event pairs, 110 based on Foata normal form. 15/592 useless extension candidates. Maximal degree in co-relation 1381. Up to 301 conditions per place. [2022-12-12 14:21:11,934 INFO L137 encePairwiseOnDemand]: 78/82 looper letters, 66 selfloop transitions, 6 changer transitions 0/84 dead transitions. [2022-12-12 14:21:11,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 350 flow [2022-12-12 14:21:11,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:21:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:21:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2022-12-12 14:21:11,935 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3231707317073171 [2022-12-12 14:21:11,935 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 120 flow. Second operand 6 states and 159 transitions. [2022-12-12 14:21:11,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 350 flow [2022-12-12 14:21:11,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 345 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:21:11,938 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 155 flow [2022-12-12 14:21:11,938 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=155, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2022-12-12 14:21:11,940 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, -22 predicate places. [2022-12-12 14:21:11,940 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 155 flow [2022-12-12 14:21:11,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:11,940 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:21:11,940 INFO L214 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] [2022-12-12 14:21:11,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-12 14:21:12,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 14:21:12,147 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:21:12,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:21:12,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1122003715, now seen corresponding path program 2 times [2022-12-12 14:21:12,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:21:12,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660925693] [2022-12-12 14:21:12,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:21:12,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:21:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:21:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:21:12,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:21:12,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660925693] [2022-12-12 14:21:12,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660925693] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 14:21:12,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286630564] [2022-12-12 14:21:12,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 14:21:12,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 14:21:12,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:21:12,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 14:21:12,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-12 14:21:12,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 14:21:12,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 14:21:12,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-12 14:21:12,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 14:21:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:21:12,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 14:21:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:21:12,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286630564] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 14:21:12,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 14:21:12,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-12 14:21:12,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740257783] [2022-12-12 14:21:12,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 14:21:12,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-12 14:21:12,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:21:12,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-12 14:21:12,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-12 14:21:12,569 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 82 [2022-12-12 14:21:12,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 155 flow. Second operand has 13 states, 13 states have (on average 19.076923076923077) internal successors, (248), 13 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:12,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:21:12,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 82 [2022-12-12 14:21:12,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:21:12,767 INFO L130 PetriNetUnfolder]: 438/1233 cut-off events. [2022-12-12 14:21:12,770 INFO L131 PetriNetUnfolder]: For 408/408 co-relation queries the response was YES. [2022-12-12 14:21:12,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2572 conditions, 1233 events. 438/1233 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4842 event pairs, 110 based on Foata normal form. 30/1075 useless extension candidates. Maximal degree in co-relation 2562. Up to 301 conditions per place. [2022-12-12 14:21:12,775 INFO L137 encePairwiseOnDemand]: 78/82 looper letters, 126 selfloop transitions, 12 changer transitions 0/150 dead transitions. [2022-12-12 14:21:12,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 150 transitions, 717 flow [2022-12-12 14:21:12,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-12 14:21:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-12 14:21:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 312 transitions. [2022-12-12 14:21:12,776 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3170731707317073 [2022-12-12 14:21:12,776 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 155 flow. Second operand 12 states and 312 transitions. [2022-12-12 14:21:12,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 150 transitions, 717 flow [2022-12-12 14:21:12,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 150 transitions, 697 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-12 14:21:12,782 INFO L231 Difference]: Finished difference. Result has 76 places, 57 transitions, 243 flow [2022-12-12 14:21:12,782 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=243, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2022-12-12 14:21:12,784 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, -5 predicate places. [2022-12-12 14:21:12,784 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 243 flow [2022-12-12 14:21:12,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 19.076923076923077) internal successors, (248), 13 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:12,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:21:12,784 INFO L214 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] [2022-12-12 14:21:12,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-12 14:21:12,989 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 [2022-12-12 14:21:12,990 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:21:12,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:21:12,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1632759235, now seen corresponding path program 3 times [2022-12-12 14:21:12,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:21:12,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448267341] [2022-12-12 14:21:12,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:21:12,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:21:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:21:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:21:13,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:21:13,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448267341] [2022-12-12 14:21:13,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448267341] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 14:21:13,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389130530] [2022-12-12 14:21:13,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 14:21:13,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 14:21:13,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:21:13,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 14:21:13,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-12 14:21:13,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-12 14:21:13,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 14:21:13,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-12 14:21:13,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 14:21:14,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-12 14:21:14,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:14,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-12 14:21:14,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 14:21:14,176 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-12 14:21:14,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-12 14:21:14,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:14,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-12 14:21:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-12-12 14:21:14,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 14:21:14,307 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_576 (Array Int Int)) (v_ArrVal_578 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_576) |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_578) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse0 .cse1)))))) is different from false [2022-12-12 14:21:14,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 14:21:14,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2022-12-12 14:21:14,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 14:21:14,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 83 [2022-12-12 14:21:14,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2022-12-12 14:21:14,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-12 14:21:14,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 14:21:14,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2022-12-12 14:21:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 68 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 8 not checked. [2022-12-12 14:21:14,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389130530] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 14:21:14,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 14:21:14,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2022-12-12 14:21:14,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248707282] [2022-12-12 14:21:14,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 14:21:14,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-12 14:21:14,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:21:14,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-12 14:21:14,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=434, Unknown=1, NotChecked=44, Total=600 [2022-12-12 14:21:14,547 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 82 [2022-12-12 14:21:14,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 243 flow. Second operand has 25 states, 25 states have (on average 12.6) internal successors, (315), 25 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:14,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:21:14,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 82 [2022-12-12 14:21:14,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:21:16,148 INFO L130 PetriNetUnfolder]: 1270/2887 cut-off events. [2022-12-12 14:21:16,148 INFO L131 PetriNetUnfolder]: For 1254/1254 co-relation queries the response was YES. [2022-12-12 14:21:16,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7062 conditions, 2887 events. 1270/2887 cut-off events. For 1254/1254 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 13032 event pairs, 30 based on Foata normal form. 10/2244 useless extension candidates. Maximal degree in co-relation 7045. Up to 442 conditions per place. [2022-12-12 14:21:16,159 INFO L137 encePairwiseOnDemand]: 71/82 looper letters, 305 selfloop transitions, 100 changer transitions 49/459 dead transitions. [2022-12-12 14:21:16,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 459 transitions, 2271 flow [2022-12-12 14:21:16,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-12 14:21:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-12-12 14:21:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 769 transitions. [2022-12-12 14:21:16,163 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2180941576857629 [2022-12-12 14:21:16,163 INFO L175 Difference]: Start difference. First operand has 76 places, 57 transitions, 243 flow. Second operand 43 states and 769 transitions. [2022-12-12 14:21:16,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 459 transitions, 2271 flow [2022-12-12 14:21:16,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 459 transitions, 2259 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-12 14:21:16,170 INFO L231 Difference]: Finished difference. Result has 140 places, 157 transitions, 1058 flow [2022-12-12 14:21:16,171 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=1058, PETRI_PLACES=140, PETRI_TRANSITIONS=157} [2022-12-12 14:21:16,171 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 59 predicate places. [2022-12-12 14:21:16,171 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 157 transitions, 1058 flow [2022-12-12 14:21:16,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.6) internal successors, (315), 25 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:16,171 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:21:16,172 INFO L214 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:21:16,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-12 14:21:16,377 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 [2022-12-12 14:21:16,378 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:21:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:21:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash 969561687, now seen corresponding path program 1 times [2022-12-12 14:21:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:21:16,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967207365] [2022-12-12 14:21:16,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:21:16,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:21:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:21:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:21:16,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:21:16,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967207365] [2022-12-12 14:21:16,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967207365] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 14:21:16,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93393765] [2022-12-12 14:21:16,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:21:16,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 14:21:16,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:21:16,715 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 14:21:16,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-12 14:21:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:21:16,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-12 14:21:16,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 14:21:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:21:17,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 14:21:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:21:17,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93393765] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 14:21:17,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 14:21:17,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 23 [2022-12-12 14:21:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784227858] [2022-12-12 14:21:17,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 14:21:17,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-12 14:21:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:21:17,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-12 14:21:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-12-12 14:21:17,194 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 82 [2022-12-12 14:21:17,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 157 transitions, 1058 flow. Second operand has 23 states, 23 states have (on average 19.608695652173914) internal successors, (451), 23 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:17,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:21:17,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 82 [2022-12-12 14:21:17,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:21:17,941 INFO L130 PetriNetUnfolder]: 1294/3455 cut-off events. [2022-12-12 14:21:17,941 INFO L131 PetriNetUnfolder]: For 29654/29654 co-relation queries the response was YES. [2022-12-12 14:21:17,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13510 conditions, 3455 events. 1294/3455 cut-off events. For 29654/29654 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 15492 event pairs, 174 based on Foata normal form. 90/3191 useless extension candidates. Maximal degree in co-relation 13467. Up to 483 conditions per place. [2022-12-12 14:21:17,966 INFO L137 encePairwiseOnDemand]: 78/82 looper letters, 328 selfloop transitions, 44 changer transitions 0/394 dead transitions. [2022-12-12 14:21:17,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 394 transitions, 4287 flow [2022-12-12 14:21:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-12 14:21:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-12 14:21:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 565 transitions. [2022-12-12 14:21:17,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31319290465631927 [2022-12-12 14:21:17,968 INFO L175 Difference]: Start difference. First operand has 140 places, 157 transitions, 1058 flow. Second operand 22 states and 565 transitions. [2022-12-12 14:21:17,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 394 transitions, 4287 flow [2022-12-12 14:21:18,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 394 transitions, 4152 flow, removed 14 selfloop flow, removed 11 redundant places. [2022-12-12 14:21:18,005 INFO L231 Difference]: Finished difference. Result has 158 places, 175 transitions, 1319 flow [2022-12-12 14:21:18,006 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1319, PETRI_PLACES=158, PETRI_TRANSITIONS=175} [2022-12-12 14:21:18,006 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 77 predicate places. [2022-12-12 14:21:18,006 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 175 transitions, 1319 flow [2022-12-12 14:21:18,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 19.608695652173914) internal successors, (451), 23 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:18,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:21:18,007 INFO L214 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 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] [2022-12-12 14:21:18,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-12 14:21:18,213 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 [2022-12-12 14:21:18,213 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:21:18,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:21:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash 771191297, now seen corresponding path program 2 times [2022-12-12 14:21:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:21:18,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495010327] [2022-12-12 14:21:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:21:18,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:21:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:21:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 782 proven. 34 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2022-12-12 14:21:21,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:21:21,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495010327] [2022-12-12 14:21:21,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495010327] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 14:21:21,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820407784] [2022-12-12 14:21:21,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 14:21:21,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 14:21:21,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:21:21,298 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 14:21:21,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-12 14:21:21,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 14:21:21,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 14:21:21,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-12 14:21:21,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 14:21:21,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-12 14:21:21,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:21,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-12 14:21:21,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 14:21:21,832 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-12 14:21:21,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-12 14:21:21,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:21,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-12 14:21:21,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-12 14:21:21,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:21,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-12 14:21:22,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 14:21:22,013 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-12 14:21:22,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-12 14:21:22,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:22,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-12 14:21:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 434 proven. 16 refuted. 0 times theorem prover too weak. 845 trivial. 0 not checked. [2022-12-12 14:21:22,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 14:21:22,126 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1235 (Array Int Int)) (v_ArrVal_1236 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1235) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1236)) .cse1)) 20))) is different from false [2022-12-12 14:21:22,133 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1235 (Array Int Int)) (v_ArrVal_1236 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1235) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1236)) .cse1))))) is different from false [2022-12-12 14:21:22,151 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1231 Int) (v_ArrVal_1235 (Array Int Int)) (v_ArrVal_1236 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1231) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1235) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1236)) .cse1)) 20))) is different from false [2022-12-12 14:21:22,163 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1231 Int) (v_ArrVal_1235 (Array Int Int)) (v_ArrVal_1236 Int) (v_ArrVal_1229 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (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_1229)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1231) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1235) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1236)) .cse1)) 20))) is different from false [2022-12-12 14:21:22,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 14:21:22,251 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 205 treesize of output 145 [2022-12-12 14:21:22,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 14:21:22,260 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 227 treesize of output 225 [2022-12-12 14:21:22,265 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 242 treesize of output 226 [2022-12-12 14:21:22,273 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 233 treesize of output 209 [2022-12-12 14:21:22,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-12 14:21:22,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 14:21:22,320 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 116 treesize of output 104 [2022-12-12 14:21:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 424 proven. 11 refuted. 1 times theorem prover too weak. 845 trivial. 14 not checked. [2022-12-12 14:21:22,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820407784] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 14:21:22,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 14:21:22,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 33 [2022-12-12 14:21:22,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381713402] [2022-12-12 14:21:22,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 14:21:22,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-12 14:21:22,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:21:22,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-12 14:21:22,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=647, Unknown=13, NotChecked=236, Total=1122 [2022-12-12 14:21:22,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 82 [2022-12-12 14:21:22,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 175 transitions, 1319 flow. Second operand has 34 states, 34 states have (on average 11.911764705882353) internal successors, (405), 34 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:22,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:21:22,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 82 [2022-12-12 14:21:22,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:21:24,886 INFO L130 PetriNetUnfolder]: 3670/8690 cut-off events. [2022-12-12 14:21:24,886 INFO L131 PetriNetUnfolder]: For 96194/96194 co-relation queries the response was YES. [2022-12-12 14:21:24,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38021 conditions, 8690 events. 3670/8690 cut-off events. For 96194/96194 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 49266 event pairs, 132 based on Foata normal form. 236/7844 useless extension candidates. Maximal degree in co-relation 37969. Up to 2491 conditions per place. [2022-12-12 14:21:24,952 INFO L137 encePairwiseOnDemand]: 69/82 looper letters, 249 selfloop transitions, 174 changer transitions 1/429 dead transitions. [2022-12-12 14:21:24,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 429 transitions, 4029 flow [2022-12-12 14:21:24,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-12 14:21:24,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-12 14:21:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 339 transitions. [2022-12-12 14:21:24,954 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22967479674796748 [2022-12-12 14:21:24,954 INFO L175 Difference]: Start difference. First operand has 158 places, 175 transitions, 1319 flow. Second operand 18 states and 339 transitions. [2022-12-12 14:21:24,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 429 transitions, 4029 flow [2022-12-12 14:21:25,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 429 transitions, 3932 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-12-12 14:21:25,107 INFO L231 Difference]: Finished difference. Result has 172 places, 271 transitions, 2645 flow [2022-12-12 14:21:25,107 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1265, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2645, PETRI_PLACES=172, PETRI_TRANSITIONS=271} [2022-12-12 14:21:25,108 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 91 predicate places. [2022-12-12 14:21:25,108 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 271 transitions, 2645 flow [2022-12-12 14:21:25,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 11.911764705882353) internal successors, (405), 34 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:25,109 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:21:25,109 INFO L214 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 14, 14, 14, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:21:25,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-12 14:21:25,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 14:21:25,326 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:21:25,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:21:25,327 INFO L85 PathProgramCache]: Analyzing trace with hash -279900501, now seen corresponding path program 3 times [2022-12-12 14:21:25,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:21:25,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160144306] [2022-12-12 14:21:25,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:21:25,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:21:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:21:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 768 proven. 57 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2022-12-12 14:21:27,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:21:27,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160144306] [2022-12-12 14:21:27,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160144306] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 14:21:27,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517659631] [2022-12-12 14:21:27,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 14:21:27,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 14:21:27,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:21:27,621 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 14:21:27,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-12 14:21:28,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-12 14:21:28,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 14:21:28,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 125 conjunts are in the unsatisfiable core [2022-12-12 14:21:28,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 14:21:28,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:28,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:28,732 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-12 14:21:28,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 35 [2022-12-12 14:21:28,745 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-12 14:21:28,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-12 14:21:28,752 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 20 treesize of output 28 [2022-12-12 14:21:28,809 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 25 [2022-12-12 14:21:28,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 14:21:28,888 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-12 14:21:28,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2022-12-12 14:21:28,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:28,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 14:21:28,955 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 32 treesize of output 25 [2022-12-12 14:21:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1261 trivial. 0 not checked. [2022-12-12 14:21:28,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-12 14:21:28,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517659631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:21:28,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-12 14:21:28,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 22 [2022-12-12 14:21:28,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32150723] [2022-12-12 14:21:28,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:21:28,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 14:21:28,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:21:28,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 14:21:28,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2022-12-12 14:21:28,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 82 [2022-12-12 14:21:28,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 271 transitions, 2645 flow. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:28,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:21:28,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 82 [2022-12-12 14:21:28,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:21:30,785 INFO L130 PetriNetUnfolder]: 3679/8712 cut-off events. [2022-12-12 14:21:30,786 INFO L131 PetriNetUnfolder]: For 112422/112422 co-relation queries the response was YES. [2022-12-12 14:21:30,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49183 conditions, 8712 events. 3679/8712 cut-off events. For 112422/112422 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 49134 event pairs, 625 based on Foata normal form. 4/7631 useless extension candidates. Maximal degree in co-relation 49122. Up to 8054 conditions per place. [2022-12-12 14:21:30,860 INFO L137 encePairwiseOnDemand]: 74/82 looper letters, 276 selfloop transitions, 11 changer transitions 1/293 dead transitions. [2022-12-12 14:21:30,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 293 transitions, 3399 flow [2022-12-12 14:21:30,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:21:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:21:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-12-12 14:21:30,861 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19686411149825783 [2022-12-12 14:21:30,862 INFO L175 Difference]: Start difference. First operand has 172 places, 271 transitions, 2645 flow. Second operand 7 states and 113 transitions. [2022-12-12 14:21:30,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 293 transitions, 3399 flow [2022-12-12 14:21:31,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 293 transitions, 2973 flow, removed 177 selfloop flow, removed 15 redundant places. [2022-12-12 14:21:31,049 INFO L231 Difference]: Finished difference. Result has 166 places, 275 transitions, 2332 flow [2022-12-12 14:21:31,050 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=2267, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2332, PETRI_PLACES=166, PETRI_TRANSITIONS=275} [2022-12-12 14:21:31,051 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 85 predicate places. [2022-12-12 14:21:31,051 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 275 transitions, 2332 flow [2022-12-12 14:21:31,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:31,051 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:21:31,051 INFO L214 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 14, 14, 14, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:21:31,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-12 14:21:31,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 14:21:31,261 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:21:31,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:21:31,261 INFO L85 PathProgramCache]: Analyzing trace with hash 853445143, now seen corresponding path program 4 times [2022-12-12 14:21:31,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:21:31,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870409837] [2022-12-12 14:21:31,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:21:31,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:21:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:21:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1261 trivial. 0 not checked. [2022-12-12 14:21:33,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:21:33,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870409837] [2022-12-12 14:21:33,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870409837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:21:33,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:21:33,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:21:33,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233204383] [2022-12-12 14:21:33,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:21:33,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:21:33,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:21:33,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:21:33,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:21:33,021 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 82 [2022-12-12 14:21:33,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 275 transitions, 2332 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:33,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:21:33,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 82 [2022-12-12 14:21:33,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:21:34,669 INFO L130 PetriNetUnfolder]: 3598/8522 cut-off events. [2022-12-12 14:21:34,669 INFO L131 PetriNetUnfolder]: For 37653/37653 co-relation queries the response was YES. [2022-12-12 14:21:34,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38449 conditions, 8522 events. 3598/8522 cut-off events. For 37653/37653 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 47825 event pairs, 760 based on Foata normal form. 4/7467 useless extension candidates. Maximal degree in co-relation 38396. Up to 7840 conditions per place. [2022-12-12 14:21:34,719 INFO L137 encePairwiseOnDemand]: 76/82 looper letters, 273 selfloop transitions, 10 changer transitions 1/289 dead transitions. [2022-12-12 14:21:34,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 289 transitions, 3002 flow [2022-12-12 14:21:34,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:21:34,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:21:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2022-12-12 14:21:34,720 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22764227642276422 [2022-12-12 14:21:34,721 INFO L175 Difference]: Start difference. First operand has 166 places, 275 transitions, 2332 flow. Second operand 6 states and 112 transitions. [2022-12-12 14:21:34,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 289 transitions, 3002 flow [2022-12-12 14:21:34,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 289 transitions, 2984 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-12 14:21:34,810 INFO L231 Difference]: Finished difference. Result has 167 places, 271 transitions, 2338 flow [2022-12-12 14:21:34,810 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=2265, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2338, PETRI_PLACES=167, PETRI_TRANSITIONS=271} [2022-12-12 14:21:34,811 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 86 predicate places. [2022-12-12 14:21:34,811 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 271 transitions, 2338 flow [2022-12-12 14:21:34,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:21:34,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:21:34,811 INFO L214 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 14, 14, 14, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:21:34,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 14:21:34,811 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:21:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:21:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash 758954453, now seen corresponding path program 5 times [2022-12-12 14:21:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:21:34,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730423280] [2022-12-12 14:21:34,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:21:34,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:21:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:21:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 342 proven. 18 refuted. 0 times theorem prover too weak. 997 trivial. 0 not checked. [2022-12-12 14:21:37,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:21:37,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730423280] [2022-12-12 14:21:37,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730423280] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 14:21:37,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353840835] [2022-12-12 14:21:37,034 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 14:21:37,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 14:21:37,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:21:37,035 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 14:21:37,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-12 14:21:47,853 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-12-12 14:21:47,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 14:21:47,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 178 conjunts are in the unsatisfiable core [2022-12-12 14:21:47,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 14:21:47,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-12 14:21:47,941 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-12-12 14:21:47,941 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 [2022-12-12 14:21:48,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 14:21:48,023 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-12-12 14:21:48,023 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 [2022-12-12 14:21:48,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:48,093 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 [2022-12-12 14:21:48,159 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 59 treesize of output 43 [2022-12-12 14:21:48,200 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-12-12 14:21:48,201 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 50 treesize of output 63 [2022-12-12 14:21:48,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 14:21:48,282 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-12-12 14:21:48,283 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 [2022-12-12 14:21:48,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:48,346 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 [2022-12-12 14:21:48,472 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 [2022-12-12 14:21:48,522 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-12-12 14:21:48,522 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 [2022-12-12 14:21:48,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 14:21:48,628 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-12 14:21:48,628 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 [2022-12-12 14:21:48,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:48,709 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 [2022-12-12 14:21:48,810 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 [2022-12-12 14:21:48,870 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-12-12 14:21:48,871 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 [2022-12-12 14:21:48,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 14:21:48,996 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-12 14:21:48,997 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 [2022-12-12 14:21:49,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:49,069 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 [2022-12-12 14:21:49,149 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 [2022-12-12 14:21:49,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:49,181 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 [2022-12-12 14:21:49,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 14:21:49,266 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-12 14:21:49,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-12 14:21:49,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:49,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-12 14:21:49,401 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 [2022-12-12 14:21:49,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:49,434 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 [2022-12-12 14:21:49,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 14:21:49,527 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-12 14:21:49,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-12 14:21:49,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:49,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-12 14:21:49,661 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 [2022-12-12 14:21:49,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:49,698 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 [2022-12-12 14:21:49,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 14:21:49,787 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-12 14:21:49,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-12 14:21:49,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 14:21:49,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-12 14:21:49,929 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 [2022-12-12 14:21:49,976 INFO L321 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2022-12-12 14:21:49,976 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 [2022-12-12 14:21:50,035 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-12 14:21:50,035 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 34 treesize of output 27 [2022-12-12 14:21:50,060 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 22 [2022-12-12 14:21:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 995 proven. 122 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-12-12 14:21:50,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 14:27:49,865 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_202| Int) (|v_t1Thread1of1ForFork0_~i~0#1_201| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| Int) (v_ArrVal_2291 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| Int) (v_ArrVal_2293 Int) (v_ArrVal_2295 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| Int) (v_ArrVal_2297 Int) (v_ArrVal_2289 Int) (v_ArrVal_2300 Int) (v_ArrVal_2311 Int) (v_ArrVal_2310 Int) (v_ArrVal_2313 Int) (v_ArrVal_2301 Int) (v_ArrVal_2303 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 Int)) (let ((.cse4 (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_2289)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2291) .cse5 v_ArrVal_2293)))) (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_2295))))) (let ((.cse3 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| 4)) v_ArrVal_2297)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_2300) .cse1 v_ArrVal_2301)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_202| 4)) v_ArrVal_2303))))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| 4)) v_ArrVal_2305))) (let ((.cse0 (select (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse10 v_ArrVal_2307) .cse1 v_ArrVal_2310)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_201| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2311))) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2310) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_202|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| (select .cse3 .cse1))) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_202| 1) |v_t1Thread1of1ForFork0_~i~0#1_201|)) (not (<= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| 4) |c_~#queue~0.offset|) v_ArrVal_2313) .cse1))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2293) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| (select .cse6 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2301))))))))))) is different from false [2022-12-12 14:27:52,459 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_202| Int) (|v_t1Thread1of1ForFork0_~i~0#1_201| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| Int) (v_ArrVal_2291 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| Int) (v_ArrVal_2293 Int) (v_ArrVal_2295 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| Int) (v_ArrVal_2297 Int) (v_ArrVal_2289 Int) (v_ArrVal_2300 Int) (v_ArrVal_2311 Int) (v_ArrVal_2310 Int) (v_ArrVal_2313 Int) (v_ArrVal_2301 Int) (v_ArrVal_2303 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| 4) |c_~#queue~0.offset|) v_ArrVal_2289)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (let ((.cse13 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse10 v_ArrVal_2291) .cse1 v_ArrVal_2293)))) (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_2295))))) (let ((.cse3 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| 4)) v_ArrVal_2297))) (let ((.cse9 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_2300) .cse1 v_ArrVal_2301)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_202| 4)) v_ArrVal_2303))))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| 4)) v_ArrVal_2305))) (let ((.cse0 (select (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_2307) .cse1 v_ArrVal_2310)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_201| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2311))) |c_~#queue~0.base|))) (or (not (<= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| 4) |c_~#queue~0.offset|) v_ArrVal_2313) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| (select .cse3 .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_202|)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2310) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| (select .cse5 .cse1))) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_202| 1) |v_t1Thread1of1ForFork0_~i~0#1_201|)) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2293) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2301) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| (select .cse0 .cse1)))))))))))))) is different from false [2022-12-12 14:27:55,467 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_203| Int) (|v_t1Thread1of1ForFork0_~i~0#1_202| Int) (|v_t1Thread1of1ForFork0_~i~0#1_201| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| Int) (v_ArrVal_2291 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| Int) (v_ArrVal_2293 Int) (v_ArrVal_2295 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| Int) (v_ArrVal_2297 Int) (v_ArrVal_2289 Int) (v_ArrVal_2300 Int) (v_ArrVal_2311 Int) (v_ArrVal_2288 Int) (v_ArrVal_2310 Int) (v_ArrVal_2313 Int) (v_ArrVal_2301 Int) (v_ArrVal_2303 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 Int)) (let ((.cse14 (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_2288)))) (let ((.cse5 (select .cse14 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| 4) |c_~#queue~0.offset|) v_ArrVal_2289)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (store (store .cse2 .cse10 v_ArrVal_2291) .cse1 v_ArrVal_2293)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_203| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2295))))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| 4)) v_ArrVal_2297))) (let ((.cse9 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse3 .cse10 v_ArrVal_2300) .cse1 v_ArrVal_2301)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_202| 4)) v_ArrVal_2303))))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| 4)) v_ArrVal_2305))) (let ((.cse0 (select (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_2307) .cse1 v_ArrVal_2310)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_201| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2311))) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| (select .cse0 .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_203|)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2293) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2301) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| (select .cse4 .cse1))) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_202| 1) |v_t1Thread1of1ForFork0_~i~0#1_201|)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_203| 1) |v_t1Thread1of1ForFork0_~i~0#1_202|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| (select .cse6 .cse1))) (not (<= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| 4) |c_~#queue~0.offset|) v_ArrVal_2313) .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2310))))))))))))) is different from false [2022-12-12 14:31:34,036 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_204| Int) (|v_t1Thread1of1ForFork0_~i~0#1_203| Int) (|v_t1Thread1of1ForFork0_~i~0#1_202| Int) (|v_t1Thread1of1ForFork0_~i~0#1_201| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| Int) (v_ArrVal_2291 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| Int) (v_ArrVal_2293 Int) (v_ArrVal_2295 Int) (v_ArrVal_2297 Int) (v_ArrVal_2311 Int) (v_ArrVal_2310 Int) (v_ArrVal_2313 Int) (v_ArrVal_2279 Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| Int) (v_ArrVal_2289 Int) (v_ArrVal_2300 Int) (v_ArrVal_2288 Int) (v_ArrVal_2301 Int) (v_ArrVal_2303 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 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_2279)))) (let ((.cse6 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)) v_ArrVal_2281))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2283) .cse1 v_ArrVal_2285)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_204| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2288))))) (let ((.cse8 (select .cse15 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| 4) |c_~#queue~0.offset|) v_ArrVal_2289))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse0 .cse11 v_ArrVal_2291) .cse1 v_ArrVal_2293)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_203| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2295))))) (let ((.cse7 (select .cse13 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| 4)) v_ArrVal_2297))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse3 .cse11 v_ArrVal_2300) .cse1 v_ArrVal_2301)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_202| 4)) v_ArrVal_2303))))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| 4)) v_ArrVal_2305))) (let ((.cse5 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse11 v_ArrVal_2307) .cse1 v_ArrVal_2310)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_201| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2311))) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2293) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2310) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2301) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| (select .cse4 .cse1))) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_202| 1) |v_t1Thread1of1ForFork0_~i~0#1_201|)) (not (<= 20 (select (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| 4) |c_~#queue~0.offset|) v_ArrVal_2313) .cse1))) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_203| 1) |v_t1Thread1of1ForFork0_~i~0#1_202|)) (not (= (select .cse6 .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| (select .cse7 .cse1))) (not (<= v_ArrVal_2285 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| (select .cse5 .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_204|)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_204| 1) |v_t1Thread1of1ForFork0_~i~0#1_203|)))))))))))))))) is different from false [2022-12-12 14:31:39,918 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_204| Int) (|v_t1Thread1of1ForFork0_~i~0#1_203| Int) (|v_t1Thread1of1ForFork0_~i~0#1_202| Int) (|v_t1Thread1of1ForFork0_~i~0#1_201| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| Int) (v_ArrVal_2291 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| Int) (v_ArrVal_2293 Int) (v_ArrVal_2295 Int) (v_ArrVal_2297 Int) (v_ArrVal_2311 Int) (v_ArrVal_2310 Int) (v_ArrVal_2313 Int) (v_ArrVal_2279 Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| Int) (v_ArrVal_2289 Int) (v_ArrVal_2300 Int) (v_ArrVal_2288 Int) (v_ArrVal_2301 Int) (v_ArrVal_2303 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 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_2279))))) (let ((.cse4 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2281))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse4 .cse11 v_ArrVal_2283) .cse1 v_ArrVal_2285)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_204| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2288))))) (let ((.cse2 (select .cse15 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| 4) |c_~#queue~0.offset|) v_ArrVal_2289))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_2291) .cse1 v_ArrVal_2293)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_203| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2295))))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| 4)) v_ArrVal_2297))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse8 .cse11 v_ArrVal_2300) .cse1 v_ArrVal_2301)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_202| 4)) v_ArrVal_2303))))) (let ((.cse3 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| 4)) v_ArrVal_2305))) (let ((.cse6 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_2307) .cse1 v_ArrVal_2310)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_201| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2311))) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| (select .cse3 .cse1))) (not (= (select .cse4 .cse1) 20)) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2293) (not (<= 20 (select (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| 4) |c_~#queue~0.offset|) v_ArrVal_2313) .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2310) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_202| 1) |v_t1Thread1of1ForFork0_~i~0#1_201|)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_203| 1) |v_t1Thread1of1ForFork0_~i~0#1_202|)) (not (<= v_ArrVal_2285 1)) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_204|)) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2301) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_204| 1) |v_t1Thread1of1ForFork0_~i~0#1_203|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| (select .cse6 .cse1))))))))))))))))) is different from false [2022-12-12 14:31:46,126 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_204| Int) (|v_t1Thread1of1ForFork0_~i~0#1_203| Int) (|v_t1Thread1of1ForFork0_~i~0#1_202| Int) (|v_t1Thread1of1ForFork0_~i~0#1_201| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| Int) (v_ArrVal_2291 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| Int) (v_ArrVal_2293 Int) (v_ArrVal_2295 Int) (v_ArrVal_2297 Int) (v_ArrVal_2311 Int) (v_ArrVal_2310 Int) (v_ArrVal_2313 Int) (v_ArrVal_2279 Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| Int) (v_ArrVal_2289 Int) (v_ArrVal_2300 Int) (v_ArrVal_2288 Int) (v_ArrVal_2301 Int) (v_ArrVal_2303 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 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_2279))))) (let ((.cse7 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2281))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_2283) .cse1 v_ArrVal_2285)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_204| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2288))))) (let ((.cse6 (select .cse15 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| 4) |c_~#queue~0.offset|) v_ArrVal_2289))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_2291) .cse1 v_ArrVal_2293)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_203| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2295))))) (let ((.cse8 (select .cse13 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| 4)) v_ArrVal_2297))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse0 .cse11 v_ArrVal_2300) .cse1 v_ArrVal_2301)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_202| 4)) v_ArrVal_2303))))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| 4)) v_ArrVal_2305))) (let ((.cse3 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse4 .cse11 v_ArrVal_2307) .cse1 v_ArrVal_2310)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_201| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2311))) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2301) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| (select .cse2 .cse1))) (not (<= 20 (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| 4) |c_~#queue~0.offset|) v_ArrVal_2313) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2310) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2293) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_202| 1) |v_t1Thread1of1ForFork0_~i~0#1_201|)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_203| 1) |v_t1Thread1of1ForFork0_~i~0#1_202|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| (select .cse6 .cse1))) (not (<= v_ArrVal_2285 1)) (not (= (select .cse7 .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| (select .cse8 .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_204|)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_204| 1) |v_t1Thread1of1ForFork0_~i~0#1_203|)))))))))))))))) is different from false [2022-12-12 14:31:52,139 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse22 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse21 .cse22))) (or (= .cse0 20) (forall ((|v_t1Thread1of1ForFork0_~i~0#1_204| Int) (|v_t1Thread1of1ForFork0_~i~0#1_203| Int) (|v_t1Thread1of1ForFork0_~i~0#1_202| Int) (|v_t1Thread1of1ForFork0_~i~0#1_201| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| Int) (v_ArrVal_2291 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| Int) (v_ArrVal_2293 Int) (v_ArrVal_2295 Int) (v_ArrVal_2297 Int) (v_ArrVal_2311 Int) (v_ArrVal_2310 Int) (v_ArrVal_2313 Int) (v_ArrVal_2279 Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| Int) (v_ArrVal_2289 Int) (v_ArrVal_2300 Int) (v_ArrVal_2288 Int) (v_ArrVal_2301 Int) (v_ArrVal_2303 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse18 (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse21 .cse22 (+ .cse0 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_2279))))) (let ((.cse8 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2281))) (.cse12 (+ 88 |c_~#queue~0.offset|))) (let ((.cse16 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse8 .cse12 v_ArrVal_2283) .cse2 v_ArrVal_2285)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_204| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2288))))) (let ((.cse7 (select .cse16 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| 4) |c_~#queue~0.offset|) v_ArrVal_2289))) (let ((.cse14 (let ((.cse15 (store .cse16 |c_~#queue~0.base| (store (store .cse6 .cse12 v_ArrVal_2291) .cse2 v_ArrVal_2293)))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_203| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2295))))) (let ((.cse9 (select .cse14 |c_~#queue~0.base|))) (let ((.cse1 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| 4)) v_ArrVal_2297))) (let ((.cse11 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (store (store .cse1 .cse12 v_ArrVal_2300) .cse2 v_ArrVal_2301)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_202| 4)) v_ArrVal_2303))))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| 4)) v_ArrVal_2305))) (let ((.cse4 (select (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse12 v_ArrVal_2307) .cse2 v_ArrVal_2310)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_201| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2311))) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_2301) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| (select .cse3 .cse2))) (not (<= 20 (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| 4) |c_~#queue~0.offset|) v_ArrVal_2313) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| (select .cse4 .cse2))) (< (+ (select .cse5 .cse2) 1) v_ArrVal_2310) (< (+ (select .cse6 .cse2) 1) v_ArrVal_2293) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_202| 1) |v_t1Thread1of1ForFork0_~i~0#1_201|)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_203| 1) |v_t1Thread1of1ForFork0_~i~0#1_202|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| (select .cse7 .cse2))) (not (<= v_ArrVal_2285 1)) (not (= (select .cse8 .cse2) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| (select .cse9 .cse2))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_204|)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_204| 1) |v_t1Thread1of1ForFork0_~i~0#1_203|))))))))))))))))))) is different from false [2022-12-12 14:32:08,337 WARN L837 $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_204| Int) (|v_t1Thread1of1ForFork0_~i~0#1_203| Int) (|v_t1Thread1of1ForFork0_~i~0#1_202| Int) (|v_t1Thread1of1ForFork0_~i~0#1_201| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| Int) (v_ArrVal_2291 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| Int) (v_ArrVal_2293 Int) (v_ArrVal_2295 Int) (v_ArrVal_2275 Int) (v_ArrVal_2297 Int) (v_ArrVal_2311 Int) (v_ArrVal_2310 Int) (v_ArrVal_2313 Int) (v_ArrVal_2279 Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| Int) (v_ArrVal_2289 Int) (v_ArrVal_2300 Int) (v_ArrVal_2288 Int) (v_ArrVal_2301 Int) (v_ArrVal_2303 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 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_2275) .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_2279))))) (let ((.cse6 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)) v_ArrVal_2281))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2283) .cse1 v_ArrVal_2285)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_204| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2288))))) (let ((.cse3 (select .cse15 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| 4) |c_~#queue~0.offset|) v_ArrVal_2289))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse2 .cse11 v_ArrVal_2291) .cse1 v_ArrVal_2293)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_203| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2295))))) (let ((.cse8 (select .cse13 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| 4)) v_ArrVal_2297))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse4 .cse11 v_ArrVal_2300) .cse1 v_ArrVal_2301)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_202| 4)) v_ArrVal_2303))))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| 4)) v_ArrVal_2305))) (let ((.cse0 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_2307) .cse1 v_ArrVal_2310)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_201| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2311))) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2293) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2301) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| (select .cse5 .cse1))) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_202| 1) |v_t1Thread1of1ForFork0_~i~0#1_201|)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_203| 1) |v_t1Thread1of1ForFork0_~i~0#1_202|)) (not (<= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| 4) |c_~#queue~0.offset|) v_ArrVal_2313) .cse1))) (not (= (select .cse6 .cse1) 20)) (not (<= v_ArrVal_2285 1)) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2310) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| (select .cse8 .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_204|)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_204| 1) |v_t1Thread1of1ForFork0_~i~0#1_203|)))))))))))))))) (= .cse22 20)))) is different from false [2022-12-12 14:33:03,513 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_204| Int) (|v_t1Thread1of1ForFork0_~i~0#1_203| Int) (|v_t1Thread1of1ForFork0_~i~0#1_202| Int) (|v_t1Thread1of1ForFork0_~i~0#1_201| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| Int) (v_ArrVal_2291 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2275 Int) (v_ArrVal_2297 Int) (v_ArrVal_2311 Int) (v_ArrVal_2310 Int) (v_ArrVal_2313 Int) (v_ArrVal_2279 Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| Int) (v_ArrVal_2289 Int) (v_ArrVal_2300 Int) (v_ArrVal_2288 Int) (v_ArrVal_2301 Int) (v_ArrVal_2303 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 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_2273)) (.cse22 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (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_2275) .cse22 (+ .cse7 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_2279))))) (let ((.cse9 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* 4 (select .cse19 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2281))) (.cse12 (+ 88 |c_~#queue~0.offset|))) (let ((.cse16 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse9 .cse12 v_ArrVal_2283) .cse1 v_ArrVal_2285)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_204| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2288))))) (let ((.cse3 (select .cse16 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| 4) |c_~#queue~0.offset|) v_ArrVal_2289))) (let ((.cse14 (let ((.cse15 (store .cse16 |c_~#queue~0.base| (store (store .cse0 .cse12 v_ArrVal_2291) .cse1 v_ArrVal_2293)))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_203| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2295))))) (let ((.cse8 (select .cse14 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| 4)) v_ArrVal_2297))) (let ((.cse11 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (store (store .cse6 .cse12 v_ArrVal_2300) .cse1 v_ArrVal_2301)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_202| 4)) v_ArrVal_2303))))) (let ((.cse5 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| 4)) v_ArrVal_2305))) (let ((.cse2 (select (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse4 .cse12 v_ArrVal_2307) .cse1 v_ArrVal_2310)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_201| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2311))) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2293) (not (<= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| 4) |c_~#queue~0.offset|) v_ArrVal_2313) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2310) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| (select .cse5 .cse1))) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_202| 1) |v_t1Thread1of1ForFork0_~i~0#1_201|)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_203| 1) |v_t1Thread1of1ForFork0_~i~0#1_202|)) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2301) (= .cse7 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| (select .cse8 .cse1))) (not (<= v_ArrVal_2285 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| (select .cse2 .cse1))) (not (= (select .cse9 .cse1) 20)) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_204|)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_204| 1) |v_t1Thread1of1ForFork0_~i~0#1_203|)))))))))))))))))) is different from false [2022-12-12 14:33:51,757 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_204| Int) (|v_t1Thread1of1ForFork0_~i~0#1_203| Int) (|v_t1Thread1of1ForFork0_~i~0#1_202| Int) (|v_t1Thread1of1ForFork0_~i~0#1_201| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| Int) (v_ArrVal_2291 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2275 Int) (v_ArrVal_2297 Int) (v_ArrVal_2311 Int) (v_ArrVal_2310 Int) (v_ArrVal_2313 Int) (v_ArrVal_2279 Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| Int) (v_ArrVal_2289 Int) (v_ArrVal_2300 Int) (v_ArrVal_2288 Int) (v_ArrVal_2301 Int) (v_ArrVal_2303 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 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_2273)))) (let ((.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse21 .cse1))) (let ((.cse18 (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse21 .cse12 v_ArrVal_2275) .cse1 (+ .cse7 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_2279))))) (let ((.cse5 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* 4 (select .cse19 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2281)))) (let ((.cse16 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse5 .cse12 v_ArrVal_2283) .cse1 v_ArrVal_2285)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_204| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2288))))) (let ((.cse9 (select .cse16 |c_~#queue~0.base|))) (let ((.cse3 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| 4) |c_~#queue~0.offset|) v_ArrVal_2289))) (let ((.cse14 (let ((.cse15 (store .cse16 |c_~#queue~0.base| (store (store .cse3 .cse12 v_ArrVal_2291) .cse1 v_ArrVal_2293)))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_203| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2295))))) (let ((.cse4 (select .cse14 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| 4)) v_ArrVal_2297))) (let ((.cse11 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (store (store .cse2 .cse12 v_ArrVal_2300) .cse1 v_ArrVal_2301)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_202| 4)) v_ArrVal_2303))))) (let ((.cse0 (select .cse11 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| 4)) v_ArrVal_2305))) (let ((.cse8 (select (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse6 .cse12 v_ArrVal_2307) .cse1 v_ArrVal_2310)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_201| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2311))) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_184| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2301) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2293) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| (select .cse4 .cse1))) (not (= (select .cse5 .cse1) 20)) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2310) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_202| 1) |v_t1Thread1of1ForFork0_~i~0#1_201|)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_203| 1) |v_t1Thread1of1ForFork0_~i~0#1_202|)) (= .cse7 20) (not (<= v_ArrVal_2285 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_188| (select .cse9 .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_204|)) (not (<= 20 (select (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_182| 4) |c_~#queue~0.offset|) v_ArrVal_2313) .cse1))) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_204| 1) |v_t1Thread1of1ForFork0_~i~0#1_203|))))))))))))))))))) is different from false Received shutdown request... [2022-12-12 14:35:23,557 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 [2022-12-12 14:35:23,557 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 [2022-12-12 14:35:24,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-12 14:35:24,758 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 [2022-12-12 14:35:24,853 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 [2022-12-12 14:35:24,854 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 14:35:24,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 14:35:24,854 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. [2022-12-12 14:35:24,855 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-12 14:35:24,855 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 14:35:24,855 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 14:35:24,855 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-12 14:35:24,856 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1] [2022-12-12 14:35:24,858 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:35:24,858 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:35:24,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:35:24 BasicIcfg [2022-12-12 14:35:24,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:35:24,860 INFO L158 Benchmark]: Toolchain (without parser) took 864477.76ms. Allocated memory was 175.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 149.3MB in the beginning and 829.2MB in the end (delta: -679.9MB). Peak memory consumption was 952.8MB. Max. memory is 8.0GB. [2022-12-12 14:35:24,861 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:35:24,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.48ms. Allocated memory is still 175.1MB. Free memory was 148.9MB in the beginning and 119.0MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-12 14:35:24,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.52ms. Allocated memory is still 175.1MB. Free memory was 119.0MB in the beginning and 116.1MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 14:35:24,861 INFO L158 Benchmark]: Boogie Preprocessor took 42.72ms. Allocated memory is still 175.1MB. Free memory was 116.1MB in the beginning and 114.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:35:24,861 INFO L158 Benchmark]: RCFGBuilder took 538.80ms. Allocated memory is still 175.1MB. Free memory was 114.0MB in the beginning and 134.0MB in the end (delta: -20.0MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. [2022-12-12 14:35:24,861 INFO L158 Benchmark]: TraceAbstraction took 863385.53ms. Allocated memory was 175.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 133.0MB in the beginning and 829.2MB in the end (delta: -696.2MB). Peak memory consumption was 937.5MB. Max. memory is 8.0GB. [2022-12-12 14:35:24,862 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.48ms. Allocated memory is still 175.1MB. Free memory was 148.9MB in the beginning and 119.0MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.52ms. Allocated memory is still 175.1MB. Free memory was 119.0MB in the beginning and 116.1MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.72ms. Allocated memory is still 175.1MB. Free memory was 116.1MB in the beginning and 114.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 538.80ms. Allocated memory is still 175.1MB. Free memory was 114.0MB in the beginning and 134.0MB in the end (delta: -20.0MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. * TraceAbstraction took 863385.53ms. Allocated memory was 175.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 133.0MB in the beginning and 829.2MB in the end (delta: -696.2MB). Peak memory consumption was 937.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3s, 198 PlacesBefore, 81 PlacesAfterwards, 204 TransitionsBefore, 82 TransitionsAfterwards, 9810 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 97 ConcurrentYvCompositions, 6 ChoiceCompositions, 167 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9707, independent: 9459, independent conditional: 9459, independent unconditional: 0, dependent: 248, dependent conditional: 248, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9707, independent: 9459, independent conditional: 0, independent unconditional: 9459, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9707, independent: 9459, independent conditional: 0, independent unconditional: 9459, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9707, independent: 9459, independent conditional: 0, independent unconditional: 9459, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7053, independent: 6946, independent conditional: 0, independent unconditional: 6946, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7053, independent: 6926, independent conditional: 0, independent unconditional: 6926, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 127, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 185, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9707, independent: 2513, independent conditional: 0, independent unconditional: 2513, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 7053, unknown conditional: 0, unknown unconditional: 7053] , Statistics on independence cache: Total cache size (in pairs): 14193, Positive cache size: 14086, Positive conditional cache size: 0, Positive unconditional cache size: 14086, Negative cache size: 107, Negative conditional cache size: 0, Negative unconditional cache size: 107, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 325 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: 863.3s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2438 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2438 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 536 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 306 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2733 IncrementalHoareTripleChecker+Invalid, 3575 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 306 mSolverCounterUnsat, 9 mSDtfsCounter, 2733 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1228 GetRequests, 1026 SyntacticMatches, 28 SemanticMatches, 174 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2295 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2645occurred in iteration=9, InterpolantAutomatonStates: 125, 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, 2.3s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 1457 NumberOfCodeBlocks, 1291 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1872 ConstructedInterpolants, 14 QuantifiedInterpolants, 8267 SizeOfPredicates, 48 NumberOfNonLiveVariables, 3482 ConjunctsInSsa, 261 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 8376/10201 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