/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:13:18,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:13:18,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:13:18,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:13:18,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:13:18,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:13:18,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:13:18,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:13:18,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:13:18,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:13:18,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:13:18,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:13:18,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:13:18,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:13:18,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:13:18,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:13:18,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:13:18,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:13:18,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:13:18,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:13:18,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:13:18,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:13:18,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:13:18,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:13:18,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:13:18,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:13:18,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:13:18,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:13:18,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:13:18,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:13:18,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:13:18,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:13:18,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:13:18,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:13:18,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:13:18,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:13:18,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:13:18,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:13:18,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:13:18,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:13:18,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:13:18,142 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-RepeatedSemanticLbe.epf [2022-12-06 03:13:18,173 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:13:18,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:13:18,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:13:18,175 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:13:18,175 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:13:18,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:13:18,176 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:13:18,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:13:18,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:13:18,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:13:18,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:13:18,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:13:18,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:13:18,178 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:13:18,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:13:18,178 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:13:18,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:13:18,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:13:18,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:13:18,179 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:13:18,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:13:18,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:13:18,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:13:18,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:13:18,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:13:18,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:13:18,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:13:18,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:13:18,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 03:13:18,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:13:18,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:13:18,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:13:18,514 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:13:18,515 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:13:18,516 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-12-06 03:13:19,697 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:13:19,941 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:13:19,943 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-12-06 03:13:19,949 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5630c847/e8feb8ae46554fafb4d23df757f63541/FLAG78d86d9be [2022-12-06 03:13:19,964 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5630c847/e8feb8ae46554fafb4d23df757f63541 [2022-12-06 03:13:19,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:13:19,967 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:13:19,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:13:19,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:13:19,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:13:19,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:13:19" (1/1) ... [2022-12-06 03:13:19,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@586637c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:13:19, skipping insertion in model container [2022-12-06 03:13:19,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:13:19" (1/1) ... [2022-12-06 03:13:19,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:13:19,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:13:20,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,155 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3107,3120] [2022-12-06 03:13:20,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:13:20,179 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:13:20,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:13:20,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:13:20,221 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3107,3120] [2022-12-06 03:13:20,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:13:20,244 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:13:20,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:13:20 WrapperNode [2022-12-06 03:13:20,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:13:20,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:13:20,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:13:20,247 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:13:20,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:13:20" (1/1) ... [2022-12-06 03:13:20,270 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:13:20" (1/1) ... [2022-12-06 03:13:20,302 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 161 [2022-12-06 03:13:20,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:13:20,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:13:20,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:13:20,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:13:20,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:13:20" (1/1) ... [2022-12-06 03:13:20,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:13:20" (1/1) ... [2022-12-06 03:13:20,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:13:20" (1/1) ... [2022-12-06 03:13:20,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:13:20" (1/1) ... [2022-12-06 03:13:20,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:13:20" (1/1) ... [2022-12-06 03:13:20,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:13:20" (1/1) ... [2022-12-06 03:13:20,337 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:13:20" (1/1) ... [2022-12-06 03:13:20,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:13:20" (1/1) ... [2022-12-06 03:13:20,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:13:20,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:13:20,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:13:20,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:13:20,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:13:20" (1/1) ... [2022-12-06 03:13:20,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:13:20,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:13:20,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 03:13:20,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 03:13:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:13:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:13:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:13:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 03:13:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 03:13:20,422 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 03:13:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 03:13:20,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 03:13:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 03:13:20,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 03:13:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:13:20,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 03:13:20,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 03:13:20,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 03:13:20,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:13:20,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:13:20,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:13:20,425 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 03:13:20,538 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:13:20,540 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:13:20,786 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:13:20,861 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:13:20,861 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 03:13:20,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:13:20 BoogieIcfgContainer [2022-12-06 03:13:20,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:13:20,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:13:20,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:13:20,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:13:20,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:13:19" (1/3) ... [2022-12-06 03:13:20,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cceb5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:13:20, skipping insertion in model container [2022-12-06 03:13:20,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:13:20" (2/3) ... [2022-12-06 03:13:20,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cceb5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:13:20, skipping insertion in model container [2022-12-06 03:13:20,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:13:20" (3/3) ... [2022-12-06 03:13:20,870 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-12-06 03:13:20,886 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:13:20,887 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:13:20,887 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:13:20,977 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 03:13:21,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 132 transitions, 288 flow [2022-12-06 03:13:21,078 INFO L130 PetriNetUnfolder]: 10/129 cut-off events. [2022-12-06 03:13:21,079 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:13:21,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 10/129 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2022-12-06 03:13:21,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 132 transitions, 288 flow [2022-12-06 03:13:21,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 119 transitions, 256 flow [2022-12-06 03:13:21,090 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:21,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 119 transitions, 256 flow [2022-12-06 03:13:21,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 119 transitions, 256 flow [2022-12-06 03:13:21,146 INFO L130 PetriNetUnfolder]: 10/119 cut-off events. [2022-12-06 03:13:21,147 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:13:21,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 119 events. 10/119 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2022-12-06 03:13:21,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 119 transitions, 256 flow [2022-12-06 03:13:21,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 1262 [2022-12-06 03:13:26,431 INFO L203 LiptonReduction]: Total number of compositions: 95 [2022-12-06 03:13:26,445 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:13:26,450 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=REPEATED_LIPTON_PN, 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;@1f882190, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:13:26,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 03:13:26,457 INFO L130 PetriNetUnfolder]: 3/23 cut-off events. [2022-12-06 03:13:26,457 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:13:26,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:26,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:26,458 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:13:26,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:26,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1488971194, now seen corresponding path program 1 times [2022-12-06 03:13:26,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:26,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268763872] [2022-12-06 03:13:26,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:26,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:26,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:26,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268763872] [2022-12-06 03:13:26,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268763872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:13:26,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:13:26,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:13:26,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991052181] [2022-12-06 03:13:26,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:13:26,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:13:26,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:26,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:13:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:13:26,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 03:13:26,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:26,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:26,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 03:13:26,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:13:27,001 INFO L130 PetriNetUnfolder]: 214/342 cut-off events. [2022-12-06 03:13:27,002 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-06 03:13:27,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 342 events. 214/342 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1052 event pairs, 15 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 616. Up to 121 conditions per place. [2022-12-06 03:13:27,009 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 48 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2022-12-06 03:13:27,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 242 flow [2022-12-06 03:13:27,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:13:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:13:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 03:13:27,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-06 03:13:27,025 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2022-12-06 03:13:27,027 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:27,027 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 53 transitions, 242 flow [2022-12-06 03:13:27,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 53 transitions, 242 flow [2022-12-06 03:13:27,051 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:13:27,053 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:13:27,055 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 03:13:27,055 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 53 transitions, 242 flow [2022-12-06 03:13:27,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:27,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:27,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:27,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:13:27,059 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:13:27,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1524762968, now seen corresponding path program 2 times [2022-12-06 03:13:27,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:27,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479750487] [2022-12-06 03:13:27,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:27,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:27,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:27,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479750487] [2022-12-06 03:13:27,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479750487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:13:27,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:13:27,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:13:27,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080465163] [2022-12-06 03:13:27,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:13:27,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:13:27,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:27,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:13:27,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:13:27,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 03:13:27,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 53 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:27,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:27,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 03:13:27,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:13:27,331 INFO L130 PetriNetUnfolder]: 209/341 cut-off events. [2022-12-06 03:13:27,332 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 03:13:27,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 341 events. 209/341 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1071 event pairs, 24 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 987. Up to 167 conditions per place. [2022-12-06 03:13:27,335 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 63 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2022-12-06 03:13:27,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 72 transitions, 465 flow [2022-12-06 03:13:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:13:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:13:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 03:13:27,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2022-12-06 03:13:27,337 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2022-12-06 03:13:27,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:27,337 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 72 transitions, 465 flow [2022-12-06 03:13:27,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 72 transitions, 465 flow [2022-12-06 03:13:27,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:13:27,341 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:13:27,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 03:13:27,342 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 72 transitions, 465 flow [2022-12-06 03:13:27,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:27,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:27,343 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:27,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 03:13:27,343 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:13:27,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:27,343 INFO L85 PathProgramCache]: Analyzing trace with hash 48420544, now seen corresponding path program 3 times [2022-12-06 03:13:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:27,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542056277] [2022-12-06 03:13:27,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:27,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:27,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:27,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542056277] [2022-12-06 03:13:27,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542056277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:13:27,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:13:27,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 03:13:27,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694448945] [2022-12-06 03:13:27,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:13:27,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:13:27,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:27,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:13:27,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:13:27,547 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 03:13:27,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 72 transitions, 465 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:27,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:27,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 03:13:27,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:13:27,736 INFO L130 PetriNetUnfolder]: 360/594 cut-off events. [2022-12-06 03:13:27,736 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-06 03:13:27,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2435 conditions, 594 events. 360/594 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2253 event pairs, 0 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 2320. Up to 337 conditions per place. [2022-12-06 03:13:27,741 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 71 selfloop transitions, 10 changer transitions 72/153 dead transitions. [2022-12-06 03:13:27,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 153 transitions, 1284 flow [2022-12-06 03:13:27,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:13:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:13:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-12-06 03:13:27,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2022-12-06 03:13:27,746 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2022-12-06 03:13:27,747 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:27,747 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 153 transitions, 1284 flow [2022-12-06 03:13:27,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 153 transitions, 1284 flow [2022-12-06 03:13:27,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:13:27,758 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:13:27,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 03:13:27,759 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 153 transitions, 1284 flow [2022-12-06 03:13:27,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:27,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:27,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:27,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 03:13:27,760 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:13:27,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash 448566155, now seen corresponding path program 1 times [2022-12-06 03:13:27,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:27,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833705406] [2022-12-06 03:13:27,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:27,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:27,901 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-06 03:13:27,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:27,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833705406] [2022-12-06 03:13:27,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833705406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:13:27,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:13:27,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:13:27,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129634625] [2022-12-06 03:13:27,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:13:27,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:13:27,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:27,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:13:27,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:13:27,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 03:13:27,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 153 transitions, 1284 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:27,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:27,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 03:13:27,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:13:28,016 INFO L130 PetriNetUnfolder]: 331/559 cut-off events. [2022-12-06 03:13:28,016 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2022-12-06 03:13:28,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2695 conditions, 559 events. 331/559 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2079 event pairs, 0 based on Foata normal form. 16/536 useless extension candidates. Maximal degree in co-relation 2611. Up to 334 conditions per place. [2022-12-06 03:13:28,020 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 60 selfloop transitions, 3 changer transitions 76/153 dead transitions. [2022-12-06 03:13:28,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 153 transitions, 1535 flow [2022-12-06 03:13:28,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:13:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:13:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 03:13:28,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 03:13:28,022 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2022-12-06 03:13:28,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:28,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 153 transitions, 1535 flow [2022-12-06 03:13:28,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 153 transitions, 1535 flow [2022-12-06 03:13:28,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:13:28,029 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:13:28,030 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 03:13:28,030 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 153 transitions, 1535 flow [2022-12-06 03:13:28,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:28,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:28,030 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:28,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 03:13:28,031 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:13:28,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:28,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1337435110, now seen corresponding path program 1 times [2022-12-06 03:13:28,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:28,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712817514] [2022-12-06 03:13:28,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:28,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:13:28,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:28,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712817514] [2022-12-06 03:13:28,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712817514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:13:28,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:13:28,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:13:28,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879527970] [2022-12-06 03:13:28,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:13:28,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:13:28,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:28,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:13:28,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:13:28,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 03:13:28,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 153 transitions, 1535 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:28,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:28,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 03:13:28,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:13:28,256 INFO L130 PetriNetUnfolder]: 364/644 cut-off events. [2022-12-06 03:13:28,256 INFO L131 PetriNetUnfolder]: For 434/434 co-relation queries the response was YES. [2022-12-06 03:13:28,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3594 conditions, 644 events. 364/644 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2597 event pairs, 0 based on Foata normal form. 28/632 useless extension candidates. Maximal degree in co-relation 3002. Up to 404 conditions per place. [2022-12-06 03:13:28,261 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 62 selfloop transitions, 2 changer transitions 117/195 dead transitions. [2022-12-06 03:13:28,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 195 transitions, 2317 flow [2022-12-06 03:13:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:13:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:13:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 03:13:28,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2022-12-06 03:13:28,262 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2022-12-06 03:13:28,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:28,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 195 transitions, 2317 flow [2022-12-06 03:13:28,269 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 195 transitions, 2317 flow [2022-12-06 03:13:28,270 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:13:30,386 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:13:30,387 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2124 [2022-12-06 03:13:30,387 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 194 transitions, 2305 flow [2022-12-06 03:13:30,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:30,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:30,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:30,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 03:13:30,388 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:13:30,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:30,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1712767705, now seen corresponding path program 1 times [2022-12-06 03:13:30,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:30,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828925011] [2022-12-06 03:13:30,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:30,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:30,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:30,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828925011] [2022-12-06 03:13:30,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828925011] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:13:30,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003274511] [2022-12-06 03:13:30,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:30,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:13:30,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:13:30,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:13:31,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 03:13:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:31,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 03:13:31,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:13:31,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 03:13:31,170 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 18 treesize of output 16 [2022-12-06 03:13:31,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:13:31,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:13:31,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:13:31,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:13:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:31,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:13:31,911 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_157 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_157) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1)) 1) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_157 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_157) c_~queue~0.base))) (or (not (= (select .cse3 .cse2) 1)) (<= 0 (+ c_~sum~0 (select .cse3 .cse1)))))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) is different from false [2022-12-06 03:13:32,109 WARN L837 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< c_~back~0 c_~n~0)) (let ((.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_155) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_157) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (<= 0 (+ (select .cse0 .cse2) c_~sum~0))))) (forall ((v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_155) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_157) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse3 .cse1) 1)) (<= (+ (select .cse3 .cse2) c_~sum~0) 1)))))) (not (<= 0 c_~back~0))) is different from false [2022-12-06 03:13:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:32,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003274511] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:13:32,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:13:32,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2022-12-06 03:13:32,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139361928] [2022-12-06 03:13:32,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:13:32,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 03:13:32,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:32,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 03:13:32,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=525, Unknown=3, NotChecked=98, Total=756 [2022-12-06 03:13:32,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 03:13:32,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 194 transitions, 2305 flow. Second operand has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:32,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:32,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 03:13:32,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:13:34,065 INFO L130 PetriNetUnfolder]: 709/1181 cut-off events. [2022-12-06 03:13:34,065 INFO L131 PetriNetUnfolder]: For 937/937 co-relation queries the response was YES. [2022-12-06 03:13:34,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7658 conditions, 1181 events. 709/1181 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5230 event pairs, 0 based on Foata normal form. 18/1161 useless extension candidates. Maximal degree in co-relation 6185. Up to 775 conditions per place. [2022-12-06 03:13:34,072 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 122 selfloop transitions, 39 changer transitions 262/423 dead transitions. [2022-12-06 03:13:34,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 423 transitions, 5635 flow [2022-12-06 03:13:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 03:13:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 03:13:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 179 transitions. [2022-12-06 03:13:34,076 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2753846153846154 [2022-12-06 03:13:34,078 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 42 predicate places. [2022-12-06 03:13:34,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:34,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 423 transitions, 5635 flow [2022-12-06 03:13:34,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 423 transitions, 5635 flow [2022-12-06 03:13:34,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:13:39,248 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:13:39,249 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5171 [2022-12-06 03:13:39,249 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 421 transitions, 5607 flow [2022-12-06 03:13:39,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:39,249 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:39,249 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:39,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 03:13:39,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 03:13:39,456 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:13:39,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:39,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1986018866, now seen corresponding path program 1 times [2022-12-06 03:13:39,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:39,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141686182] [2022-12-06 03:13:39,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:39,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:40,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:40,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141686182] [2022-12-06 03:13:40,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141686182] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:13:40,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404887580] [2022-12-06 03:13:40,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:40,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:13:40,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:13:40,355 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:13:40,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 03:13:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:40,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 03:13:40,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:13:40,474 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 03:13:40,485 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 6 treesize of output 5 [2022-12-06 03:13:40,533 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 6 treesize of output 5 [2022-12-06 03:13:40,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:13:40,660 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 18 treesize of output 20 [2022-12-06 03:13:40,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:13:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:40,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:13:40,853 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_210 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_210 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-06 03:13:41,138 WARN L837 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_209 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (or (forall ((v_ArrVal_210 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) c_~queue~0.base) .cse1)) 1)) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_209 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1)) (forall ((v_ArrVal_210 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) c_~queue~0.base) .cse1))))))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) is different from false [2022-12-06 03:13:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:41,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404887580] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:13:41,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:13:41,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2022-12-06 03:13:41,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237578674] [2022-12-06 03:13:41,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:13:41,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:13:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:41,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:13:41,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=447, Unknown=4, NotChecked=90, Total=650 [2022-12-06 03:13:41,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 03:13:41,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 421 transitions, 5607 flow. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:41,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:41,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 03:13:41,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:13:42,733 INFO L130 PetriNetUnfolder]: 1179/1943 cut-off events. [2022-12-06 03:13:42,733 INFO L131 PetriNetUnfolder]: For 1468/1468 co-relation queries the response was YES. [2022-12-06 03:13:42,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14478 conditions, 1943 events. 1179/1943 cut-off events. For 1468/1468 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9653 event pairs, 0 based on Foata normal form. 0/1888 useless extension candidates. Maximal degree in co-relation 7722. Up to 1282 conditions per place. [2022-12-06 03:13:42,745 INFO L137 encePairwiseOnDemand]: 8/27 looper letters, 202 selfloop transitions, 55 changer transitions 436/693 dead transitions. [2022-12-06 03:13:42,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 693 transitions, 10552 flow [2022-12-06 03:13:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 03:13:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 03:13:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 141 transitions. [2022-12-06 03:13:42,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2611111111111111 [2022-12-06 03:13:42,748 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 59 predicate places. [2022-12-06 03:13:42,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:42,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 693 transitions, 10552 flow [2022-12-06 03:13:42,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 693 transitions, 10552 flow [2022-12-06 03:13:42,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:13:42,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [380] $Ultimate##0-->L59: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] and [514] L110-4-->L111-3: Formula: (and (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre12#1_25| |v_#pthreadsForks_47|) (= (store |v_#memory_int_114| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_114| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre12#1_25|)) |v_#memory_int_113|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_25|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 03:13:42,791 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:13:42,791 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 03:13:42,792 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 692 transitions, 10542 flow [2022-12-06 03:13:42,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:42,792 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:42,792 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:42,799 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-06 03:13:43,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-06 03:13:43,002 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:13:43,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:43,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1437071158, now seen corresponding path program 1 times [2022-12-06 03:13:43,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:43,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397067020] [2022-12-06 03:13:43,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:43,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:43,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:43,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397067020] [2022-12-06 03:13:43,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397067020] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:13:43,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286024591] [2022-12-06 03:13:43,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:43,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:13:43,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:13:43,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:13:43,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 03:13:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:43,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 03:13:43,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:13:43,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:13:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:43,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:13:44,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:13:44,076 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 68 treesize of output 48 [2022-12-06 03:13:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:44,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286024591] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:13:44,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:13:44,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-06 03:13:44,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080992710] [2022-12-06 03:13:44,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:13:44,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 03:13:44,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:44,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 03:13:44,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-12-06 03:13:44,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 03:13:44,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 692 transitions, 10542 flow. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:44,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:44,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 03:13:44,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:13:46,188 INFO L130 PetriNetUnfolder]: 2000/3311 cut-off events. [2022-12-06 03:13:46,188 INFO L131 PetriNetUnfolder]: For 2451/2451 co-relation queries the response was YES. [2022-12-06 03:13:46,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27932 conditions, 3311 events. 2000/3311 cut-off events. For 2451/2451 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18508 event pairs, 0 based on Foata normal form. 0/3236 useless extension candidates. Maximal degree in co-relation 13096. Up to 2176 conditions per place. [2022-12-06 03:13:46,210 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 296 selfloop transitions, 99 changer transitions 844/1239 dead transitions. [2022-12-06 03:13:46,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 1239 transitions, 21271 flow [2022-12-06 03:13:46,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 03:13:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 03:13:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 206 transitions. [2022-12-06 03:13:46,213 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22991071428571427 [2022-12-06 03:13:46,215 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 89 predicate places. [2022-12-06 03:13:46,216 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:46,216 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 1239 transitions, 21271 flow [2022-12-06 03:13:46,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 1239 transitions, 21271 flow [2022-12-06 03:13:46,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:13:46,256 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:13:46,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 03:13:46,258 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 1239 transitions, 21271 flow [2022-12-06 03:13:46,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:46,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:46,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:46,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 03:13:46,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:13:46,464 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:13:46,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:46,465 INFO L85 PathProgramCache]: Analyzing trace with hash 671034712, now seen corresponding path program 2 times [2022-12-06 03:13:46,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:46,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129868011] [2022-12-06 03:13:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:46,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:47,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:47,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129868011] [2022-12-06 03:13:47,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129868011] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:13:47,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933360098] [2022-12-06 03:13:47,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:13:47,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:13:47,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:13:47,204 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:13:47,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 03:13:47,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:13:47,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:13:47,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 03:13:47,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:13:47,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:13:47,439 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 18 treesize of output 20 [2022-12-06 03:13:47,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:13:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:47,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:13:47,628 WARN L837 $PredicateComparison]: unable to prove that (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_315 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_315) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_315 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_315) c_~queue~0.base) .cse0)) 1))))) is different from false [2022-12-06 03:13:47,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:13:47,652 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 110 treesize of output 90 [2022-12-06 03:13:47,657 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 53 treesize of output 47 [2022-12-06 03:13:47,661 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 47 treesize of output 41 [2022-12-06 03:13:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:47,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933360098] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:13:47,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:13:47,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-12-06 03:13:47,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013780238] [2022-12-06 03:13:47,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:13:47,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 03:13:47,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:47,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 03:13:47,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=424, Unknown=1, NotChecked=42, Total=552 [2022-12-06 03:13:47,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 03:13:47,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 1239 transitions, 21271 flow. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:47,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:47,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 03:13:47,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:13:55,591 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 37 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:13:58,124 INFO L130 PetriNetUnfolder]: 2345/3930 cut-off events. [2022-12-06 03:13:58,125 INFO L131 PetriNetUnfolder]: For 3042/3042 co-relation queries the response was YES. [2022-12-06 03:13:58,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37061 conditions, 3930 events. 2345/3930 cut-off events. For 3042/3042 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 22639 event pairs, 0 based on Foata normal form. 0/3847 useless extension candidates. Maximal degree in co-relation 14074. Up to 2580 conditions per place. [2022-12-06 03:13:58,146 INFO L137 encePairwiseOnDemand]: 11/28 looper letters, 322 selfloop transitions, 94 changer transitions 1119/1535 dead transitions. [2022-12-06 03:13:58,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 1535 transitions, 29489 flow [2022-12-06 03:13:58,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 03:13:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 03:13:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 173 transitions. [2022-12-06 03:13:58,148 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22883597883597884 [2022-12-06 03:13:58,148 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2022-12-06 03:13:58,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:58,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 1535 transitions, 29489 flow [2022-12-06 03:13:58,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 1535 transitions, 29489 flow [2022-12-06 03:13:58,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:13:58,194 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:13:58,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 03:13:58,195 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 1535 transitions, 29489 flow [2022-12-06 03:13:58,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:58,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:58,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:58,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 03:13:58,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:13:58,401 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:13:58,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash -442467029, now seen corresponding path program 1 times [2022-12-06 03:13:58,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:58,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978975295] [2022-12-06 03:13:58,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:58,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:59,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:59,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978975295] [2022-12-06 03:13:59,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978975295] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:13:59,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347276132] [2022-12-06 03:13:59,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:59,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:13:59,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:13:59,144 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:13:59,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 03:13:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:59,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 03:13:59,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:13:59,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:13:59,394 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 18 treesize of output 20 [2022-12-06 03:13:59,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:13:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:59,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:13:59,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:13:59,667 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 110 treesize of output 90 [2022-12-06 03:13:59,672 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 53 treesize of output 47 [2022-12-06 03:13:59,677 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 47 treesize of output 41 [2022-12-06 03:13:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:59,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347276132] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:13:59,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:13:59,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2022-12-06 03:13:59,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428306351] [2022-12-06 03:13:59,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:13:59,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:13:59,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:59,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:13:59,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=546, Unknown=2, NotChecked=0, Total=650 [2022-12-06 03:13:59,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 03:13:59,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 1535 transitions, 29489 flow. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:59,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:59,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 03:13:59,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:14:06,330 INFO L130 PetriNetUnfolder]: 2555/4187 cut-off events. [2022-12-06 03:14:06,330 INFO L131 PetriNetUnfolder]: For 3315/3315 co-relation queries the response was YES. [2022-12-06 03:14:06,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43696 conditions, 4187 events. 2555/4187 cut-off events. For 3315/3315 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 24220 event pairs, 0 based on Foata normal form. 0/4140 useless extension candidates. Maximal degree in co-relation 15568. Up to 2779 conditions per place. [2022-12-06 03:14:06,354 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 389 selfloop transitions, 100 changer transitions 1114/1603 dead transitions. [2022-12-06 03:14:06,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 1603 transitions, 33845 flow [2022-12-06 03:14:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 03:14:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 03:14:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 169 transitions. [2022-12-06 03:14:06,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25148809523809523 [2022-12-06 03:14:06,357 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2022-12-06 03:14:06,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:14:06,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 1603 transitions, 33845 flow [2022-12-06 03:14:06,471 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 1603 transitions, 33845 flow [2022-12-06 03:14:06,471 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:14:06,474 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [530] L86-->L84: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_23| 256) 0)) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork2_~b~0#1_44| 256) 0))) (let ((.cse0 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_51|)) (.cse3 (= (+ v_~back~0_138 1) v_~back~0_137)) (.cse4 (= |v_thread2Thread1of1ForFork2_~b~0#1_43| (ite (= (ite .cse2 1 0) 0) 0 1))) (.cse5 (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_51| 0))) (.cse1 (select (select |v_#memory_int_143| v_~queue~0.base_76) (+ (* v_~back~0_138 4) v_~queue~0.offset_76)))) (or (and .cse0 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43| (ite (= .cse1 1) 1 0)) (not .cse2) .cse3 .cse4 (= |v_thread2Thread1of1ForFork2_#t~mem5#1_18| |v_thread2Thread1of1ForFork2_#t~mem5#1_17|) .cse5 (= |v_thread2Thread1of1ForFork2_#t~post6#1_18| |v_thread2Thread1of1ForFork2_#t~post6#1_17|)) (and .cse0 (= |v_thread2Thread1of1ForFork2_#t~post4#1_18| |v_thread2Thread1of1ForFork2_#t~post4#1_17|) (= |v_thread2Thread1of1ForFork2_#t~mem3#1_18| |v_thread2Thread1of1ForFork2_#t~mem3#1_17|) .cse3 .cse2 .cse4 .cse5 (= (ite (= (+ .cse1 1) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|))))) (not (= (ite (and (< v_~back~0_138 v_~n~0_82) (<= 0 v_~back~0_138)) 1 0) 0))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_23|, ~queue~0.offset=v_~queue~0.offset_76, thread2Thread1of1ForFork2_~b~0#1=|v_thread2Thread1of1ForFork2_~b~0#1_44|, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_18|, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_18|, ~back~0=v_~back~0_138, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_18|, ~queue~0.base=v_~queue~0.base_76, thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_18|, ~n~0=v_~n~0_82} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_23|, ~queue~0.offset=v_~queue~0.offset_76, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_17|, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_17|, ~back~0=v_~back~0_137, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|, ~queue~0.base=v_~queue~0.base_76, thread2Thread1of1ForFork2_~b~0#1=|v_thread2Thread1of1ForFork2_~b~0#1_43|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_17|, thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_17|, ~n~0=v_~n~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_~b~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem3#1, ~back~0, thread2Thread1of1ForFork2_#t~mem5#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post6#1] and [443] L113-2-->L114-1: Formula: (= (select (select |v_#memory_int_55| |v_ULTIMATE.start_main_~#t2~0#1.base_9|) |v_ULTIMATE.start_main_~#t2~0#1.offset_9|) |v_ULTIMATE.start_main_#t~mem17#1_6|) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_9|, #memory_int=|v_#memory_int_55|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_9|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_9|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_6|, #memory_int=|v_#memory_int_55|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~mem16#1] [2022-12-06 03:14:06,832 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [530] L86-->L84: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_23| 256) 0)) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork2_~b~0#1_44| 256) 0))) (let ((.cse0 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_51|)) (.cse3 (= (+ v_~back~0_138 1) v_~back~0_137)) (.cse4 (= |v_thread2Thread1of1ForFork2_~b~0#1_43| (ite (= (ite .cse2 1 0) 0) 0 1))) (.cse5 (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_51| 0))) (.cse1 (select (select |v_#memory_int_143| v_~queue~0.base_76) (+ (* v_~back~0_138 4) v_~queue~0.offset_76)))) (or (and .cse0 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43| (ite (= .cse1 1) 1 0)) (not .cse2) .cse3 .cse4 (= |v_thread2Thread1of1ForFork2_#t~mem5#1_18| |v_thread2Thread1of1ForFork2_#t~mem5#1_17|) .cse5 (= |v_thread2Thread1of1ForFork2_#t~post6#1_18| |v_thread2Thread1of1ForFork2_#t~post6#1_17|)) (and .cse0 (= |v_thread2Thread1of1ForFork2_#t~post4#1_18| |v_thread2Thread1of1ForFork2_#t~post4#1_17|) (= |v_thread2Thread1of1ForFork2_#t~mem3#1_18| |v_thread2Thread1of1ForFork2_#t~mem3#1_17|) .cse3 .cse2 .cse4 .cse5 (= (ite (= (+ .cse1 1) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|))))) (not (= (ite (and (< v_~back~0_138 v_~n~0_82) (<= 0 v_~back~0_138)) 1 0) 0))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_23|, ~queue~0.offset=v_~queue~0.offset_76, thread2Thread1of1ForFork2_~b~0#1=|v_thread2Thread1of1ForFork2_~b~0#1_44|, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_18|, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_18|, ~back~0=v_~back~0_138, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_18|, ~queue~0.base=v_~queue~0.base_76, thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_18|, ~n~0=v_~n~0_82} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_23|, ~queue~0.offset=v_~queue~0.offset_76, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_17|, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_17|, ~back~0=v_~back~0_137, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|, ~queue~0.base=v_~queue~0.base_76, thread2Thread1of1ForFork2_~b~0#1=|v_thread2Thread1of1ForFork2_~b~0#1_43|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_17|, thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_17|, ~n~0=v_~n~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_~b~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem3#1, ~back~0, thread2Thread1of1ForFork2_#t~mem5#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post6#1] and [496] L112-4-->L113-1: Formula: (= (select (select |v_#memory_int_97| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) |v_ULTIMATE.start_main_~#t1~0#1.offset_15|) |v_ULTIMATE.start_main_#t~mem16#1_12|) InVars {#memory_int=|v_#memory_int_97|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_13|, #memory_int=|v_#memory_int_97|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 03:14:07,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [530] L86-->L84: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_23| 256) 0)) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork2_~b~0#1_44| 256) 0))) (let ((.cse0 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_51|)) (.cse3 (= (+ v_~back~0_138 1) v_~back~0_137)) (.cse4 (= |v_thread2Thread1of1ForFork2_~b~0#1_43| (ite (= (ite .cse2 1 0) 0) 0 1))) (.cse5 (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_51| 0))) (.cse1 (select (select |v_#memory_int_143| v_~queue~0.base_76) (+ (* v_~back~0_138 4) v_~queue~0.offset_76)))) (or (and .cse0 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43| (ite (= .cse1 1) 1 0)) (not .cse2) .cse3 .cse4 (= |v_thread2Thread1of1ForFork2_#t~mem5#1_18| |v_thread2Thread1of1ForFork2_#t~mem5#1_17|) .cse5 (= |v_thread2Thread1of1ForFork2_#t~post6#1_18| |v_thread2Thread1of1ForFork2_#t~post6#1_17|)) (and .cse0 (= |v_thread2Thread1of1ForFork2_#t~post4#1_18| |v_thread2Thread1of1ForFork2_#t~post4#1_17|) (= |v_thread2Thread1of1ForFork2_#t~mem3#1_18| |v_thread2Thread1of1ForFork2_#t~mem3#1_17|) .cse3 .cse2 .cse4 .cse5 (= (ite (= (+ .cse1 1) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|))))) (not (= (ite (and (< v_~back~0_138 v_~n~0_82) (<= 0 v_~back~0_138)) 1 0) 0))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_23|, ~queue~0.offset=v_~queue~0.offset_76, thread2Thread1of1ForFork2_~b~0#1=|v_thread2Thread1of1ForFork2_~b~0#1_44|, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_18|, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_18|, ~back~0=v_~back~0_138, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_18|, ~queue~0.base=v_~queue~0.base_76, thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_18|, ~n~0=v_~n~0_82} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_23|, ~queue~0.offset=v_~queue~0.offset_76, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_17|, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_17|, ~back~0=v_~back~0_137, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|, ~queue~0.base=v_~queue~0.base_76, thread2Thread1of1ForFork2_~b~0#1=|v_thread2Thread1of1ForFork2_~b~0#1_43|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_17|, thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_17|, ~n~0=v_~n~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_~b~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem3#1, ~back~0, thread2Thread1of1ForFork2_#t~mem5#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post6#1] and [443] L113-2-->L114-1: Formula: (= (select (select |v_#memory_int_55| |v_ULTIMATE.start_main_~#t2~0#1.base_9|) |v_ULTIMATE.start_main_~#t2~0#1.offset_9|) |v_ULTIMATE.start_main_#t~mem17#1_6|) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_9|, #memory_int=|v_#memory_int_55|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_9|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_9|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_6|, #memory_int=|v_#memory_int_55|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~mem16#1] [2022-12-06 03:14:07,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [530] L86-->L84: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_23| 256) 0)) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork2_~b~0#1_44| 256) 0))) (let ((.cse0 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_51|)) (.cse3 (= (+ v_~back~0_138 1) v_~back~0_137)) (.cse4 (= |v_thread2Thread1of1ForFork2_~b~0#1_43| (ite (= (ite .cse2 1 0) 0) 0 1))) (.cse5 (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_51| 0))) (.cse1 (select (select |v_#memory_int_143| v_~queue~0.base_76) (+ (* v_~back~0_138 4) v_~queue~0.offset_76)))) (or (and .cse0 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43| (ite (= .cse1 1) 1 0)) (not .cse2) .cse3 .cse4 (= |v_thread2Thread1of1ForFork2_#t~mem5#1_18| |v_thread2Thread1of1ForFork2_#t~mem5#1_17|) .cse5 (= |v_thread2Thread1of1ForFork2_#t~post6#1_18| |v_thread2Thread1of1ForFork2_#t~post6#1_17|)) (and .cse0 (= |v_thread2Thread1of1ForFork2_#t~post4#1_18| |v_thread2Thread1of1ForFork2_#t~post4#1_17|) (= |v_thread2Thread1of1ForFork2_#t~mem3#1_18| |v_thread2Thread1of1ForFork2_#t~mem3#1_17|) .cse3 .cse2 .cse4 .cse5 (= (ite (= (+ .cse1 1) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|))))) (not (= (ite (and (< v_~back~0_138 v_~n~0_82) (<= 0 v_~back~0_138)) 1 0) 0))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_23|, ~queue~0.offset=v_~queue~0.offset_76, thread2Thread1of1ForFork2_~b~0#1=|v_thread2Thread1of1ForFork2_~b~0#1_44|, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_18|, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_18|, ~back~0=v_~back~0_138, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_18|, ~queue~0.base=v_~queue~0.base_76, thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_18|, ~n~0=v_~n~0_82} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_23|, ~queue~0.offset=v_~queue~0.offset_76, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_17|, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_17|, ~back~0=v_~back~0_137, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|, ~queue~0.base=v_~queue~0.base_76, thread2Thread1of1ForFork2_~b~0#1=|v_thread2Thread1of1ForFork2_~b~0#1_43|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_17|, thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_17|, ~n~0=v_~n~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_~b~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem3#1, ~back~0, thread2Thread1of1ForFork2_#t~mem5#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post6#1] and [496] L112-4-->L113-1: Formula: (= (select (select |v_#memory_int_97| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) |v_ULTIMATE.start_main_~#t1~0#1.offset_15|) |v_ULTIMATE.start_main_#t~mem16#1_12|) InVars {#memory_int=|v_#memory_int_97|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_13|, #memory_int=|v_#memory_int_97|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 03:14:07,541 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:14:07,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1185 [2022-12-06 03:14:07,542 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 1603 transitions, 33861 flow [2022-12-06 03:14:07,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:07,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:14:07,542 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:14:07,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 03:14:07,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 03:14:07,748 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:14:07,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:14:07,748 INFO L85 PathProgramCache]: Analyzing trace with hash 891146863, now seen corresponding path program 3 times [2022-12-06 03:14:07,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:14:07,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126819151] [2022-12-06 03:14:07,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:14:07,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:14:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:14:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:14:07,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:14:07,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126819151] [2022-12-06 03:14:07,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126819151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:14:07,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:14:07,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 03:14:07,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917194905] [2022-12-06 03:14:07,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:14:07,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:14:07,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:14:07,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:14:07,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:14:07,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-06 03:14:07,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 1603 transitions, 33861 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:07,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:14:07,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-06 03:14:07,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:14:10,098 INFO L130 PetriNetUnfolder]: 5183/8581 cut-off events. [2022-12-06 03:14:10,098 INFO L131 PetriNetUnfolder]: For 15314/15314 co-relation queries the response was YES. [2022-12-06 03:14:10,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94572 conditions, 8581 events. 5183/8581 cut-off events. For 15314/15314 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 56696 event pairs, 53 based on Foata normal form. 292/8732 useless extension candidates. Maximal degree in co-relation 30891. Up to 5521 conditions per place. [2022-12-06 03:14:10,146 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 569 selfloop transitions, 139 changer transitions 1868/2675 dead transitions. [2022-12-06 03:14:10,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 2675 transitions, 62132 flow [2022-12-06 03:14:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:14:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:14:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-06 03:14:10,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6102941176470589 [2022-12-06 03:14:10,147 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 134 predicate places. [2022-12-06 03:14:10,148 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:14:10,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 2675 transitions, 62132 flow [2022-12-06 03:14:10,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 2675 transitions, 62132 flow [2022-12-06 03:14:10,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:14:10,267 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:14:10,268 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 03:14:10,268 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 2675 transitions, 62132 flow [2022-12-06 03:14:10,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:10,268 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:14:10,269 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:14:10,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 03:14:10,269 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:14:10,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:14:10,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1348868622, now seen corresponding path program 1 times [2022-12-06 03:14:10,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:14:10,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131593653] [2022-12-06 03:14:10,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:14:10,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:14:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:14:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:14:11,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:14:11,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131593653] [2022-12-06 03:14:11,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131593653] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:14:11,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419735080] [2022-12-06 03:14:11,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:14:11,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:14:11,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:14:11,180 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:14:11,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 03:14:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:14:11,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 03:14:11,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:14:11,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:14:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:14:11,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:14:11,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:14:11,523 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 68 treesize of output 48 [2022-12-06 03:14:11,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:14:11,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419735080] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:14:11,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:14:11,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 19 [2022-12-06 03:14:11,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362892451] [2022-12-06 03:14:11,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:14:11,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:14:11,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:14:11,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:14:11,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:14:11,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 03:14:11,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 2675 transitions, 62132 flow. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:11,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:14:11,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 03:14:11,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:14:16,877 INFO L130 PetriNetUnfolder]: 6686/11076 cut-off events. [2022-12-06 03:14:16,878 INFO L131 PetriNetUnfolder]: For 18944/18944 co-relation queries the response was YES. [2022-12-06 03:14:16,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133131 conditions, 11076 events. 6686/11076 cut-off events. For 18944/18944 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 76225 event pairs, 59 based on Foata normal form. 18/10880 useless extension candidates. Maximal degree in co-relation 38469. Up to 7154 conditions per place. [2022-12-06 03:14:16,937 INFO L137 encePairwiseOnDemand]: 18/34 looper letters, 797 selfloop transitions, 190 changer transitions 2634/3621 dead transitions. [2022-12-06 03:14:16,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 3621 transitions, 91382 flow [2022-12-06 03:14:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 03:14:16,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 03:14:16,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 185 transitions. [2022-12-06 03:14:16,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19432773109243698 [2022-12-06 03:14:16,939 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 161 predicate places. [2022-12-06 03:14:16,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:14:16,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 3621 transitions, 91382 flow [2022-12-06 03:14:17,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 3621 transitions, 91382 flow [2022-12-06 03:14:17,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:14:17,123 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:14:17,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 03:14:17,123 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 3621 transitions, 91382 flow [2022-12-06 03:14:17,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:17,124 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:14:17,124 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:14:17,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 03:14:17,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:14:17,329 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:14:17,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:14:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2075550906, now seen corresponding path program 2 times [2022-12-06 03:14:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:14:17,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228441589] [2022-12-06 03:14:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:14:17,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:14:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:14:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:14:18,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:14:18,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228441589] [2022-12-06 03:14:18,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228441589] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:14:18,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729647463] [2022-12-06 03:14:18,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:14:18,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:14:18,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:14:18,172 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:14:18,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 03:14:18,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:14:18,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:14:18,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 03:14:18,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:14:18,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:14:18,457 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 18 treesize of output 20 [2022-12-06 03:14:18,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:14:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:14:18,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:14:18,801 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:14:18,802 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 110 treesize of output 90 [2022-12-06 03:14:18,807 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 53 treesize of output 47 [2022-12-06 03:14:18,813 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 47 treesize of output 41 [2022-12-06 03:14:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:14:19,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729647463] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:14:19,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:14:19,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 25 [2022-12-06 03:14:19,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819768361] [2022-12-06 03:14:19,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:14:19,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:14:19,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:14:19,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:14:19,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=552, Unknown=8, NotChecked=0, Total=650 [2022-12-06 03:14:19,059 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 03:14:19,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 3621 transitions, 91382 flow. Second operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:19,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:14:19,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 03:14:19,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:14:26,365 INFO L130 PetriNetUnfolder]: 7415/12251 cut-off events. [2022-12-06 03:14:26,365 INFO L131 PetriNetUnfolder]: For 20119/20119 co-relation queries the response was YES. [2022-12-06 03:14:26,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159602 conditions, 12251 events. 7415/12251 cut-off events. For 20119/20119 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 84910 event pairs, 59 based on Foata normal form. 18/12019 useless extension candidates. Maximal degree in co-relation 43757. Up to 7953 conditions per place. [2022-12-06 03:14:26,421 INFO L137 encePairwiseOnDemand]: 19/34 looper letters, 886 selfloop transitions, 182 changer transitions 2962/4030 dead transitions. [2022-12-06 03:14:26,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 4030 transitions, 109758 flow [2022-12-06 03:14:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 03:14:26,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 03:14:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 187 transitions. [2022-12-06 03:14:26,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19642857142857142 [2022-12-06 03:14:26,423 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 188 predicate places. [2022-12-06 03:14:26,424 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:14:26,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 4030 transitions, 109758 flow [2022-12-06 03:14:26,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 4030 transitions, 109758 flow [2022-12-06 03:14:26,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:14:26,582 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:14:26,583 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 03:14:26,583 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 4030 transitions, 109758 flow [2022-12-06 03:14:26,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:26,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:14:26,585 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:14:26,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 03:14:26,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:14:26,791 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:14:26,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:14:26,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1632950010, now seen corresponding path program 4 times [2022-12-06 03:14:26,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:14:26,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134161452] [2022-12-06 03:14:26,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:14:26,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:14:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:14:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:14:27,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:14:27,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134161452] [2022-12-06 03:14:27,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134161452] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:14:27,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090841009] [2022-12-06 03:14:27,685 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:14:27,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:14:27,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:14:27,688 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:14:27,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 03:14:27,816 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:14:27,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:14:27,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 03:14:27,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:14:28,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:14:28,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 14 [2022-12-06 03:14:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:14:28,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:14:28,560 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-06 03:14:28,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 194 [2022-12-06 03:14:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:14:29,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090841009] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:14:29,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:14:29,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 25 [2022-12-06 03:14:29,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621642956] [2022-12-06 03:14:29,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:14:29,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:14:29,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:14:29,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:14:29,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2022-12-06 03:14:29,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 03:14:29,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 4030 transitions, 109758 flow. Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:29,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:14:29,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 03:14:29,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:14:55,261 INFO L130 PetriNetUnfolder]: 22111/36483 cut-off events. [2022-12-06 03:14:55,261 INFO L131 PetriNetUnfolder]: For 59084/59084 co-relation queries the response was YES. [2022-12-06 03:14:55,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510330 conditions, 36483 events. 22111/36483 cut-off events. For 59084/59084 co-relation queries the response was YES. Maximal size of possible extension queue 1842. Compared 296053 event pairs, 49 based on Foata normal form. 0/35575 useless extension candidates. Maximal degree in co-relation 222818. Up to 23393 conditions per place. [2022-12-06 03:14:55,466 INFO L137 encePairwiseOnDemand]: 11/34 looper letters, 1874 selfloop transitions, 804 changer transitions 9612/12290 dead transitions. [2022-12-06 03:14:55,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 12290 transitions, 354380 flow [2022-12-06 03:14:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-12-06 03:14:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2022-12-06 03:14:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 720 transitions. [2022-12-06 03:14:55,471 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23793787177792466 [2022-12-06 03:14:55,471 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 276 predicate places. [2022-12-06 03:14:55,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:14:55,472 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 307 places, 12290 transitions, 354380 flow [2022-12-06 03:14:55,971 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 307 places, 12290 transitions, 354380 flow [2022-12-06 03:14:55,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:14:55,982 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [380] $Ultimate##0-->L59: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] and [514] L110-4-->L111-3: Formula: (and (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre12#1_25| |v_#pthreadsForks_47|) (= (store |v_#memory_int_114| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_114| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre12#1_25|)) |v_#memory_int_113|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_25|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 03:14:56,038 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:14:56,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 568 [2022-12-06 03:14:56,039 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 12289 transitions, 354358 flow [2022-12-06 03:14:56,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:56,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:14:56,039 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:14:56,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 03:14:56,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 03:14:56,241 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:14:56,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:14:56,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1990521750, now seen corresponding path program 5 times [2022-12-06 03:14:56,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:14:56,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504700029] [2022-12-06 03:14:56,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:14:56,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:14:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:14:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:14:57,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:14:57,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504700029] [2022-12-06 03:14:57,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504700029] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:14:57,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291293173] [2022-12-06 03:14:57,024 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:14:57,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:14:57,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:14:57,026 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:14:57,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 03:14:57,172 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-06 03:14:57,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:14:57,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-06 03:14:57,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:14:57,203 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-06 03:14:57,203 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 22 treesize of output 32 [2022-12-06 03:14:57,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:14:57,210 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 20 treesize of output 22 [2022-12-06 03:14:57,256 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 6 treesize of output 5 [2022-12-06 03:14:57,290 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 6 treesize of output 5 [2022-12-06 03:14:57,521 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-12-06 03:14:57,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 20 [2022-12-06 03:14:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:14:57,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:14:58,860 WARN L837 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_605 (Array Int Int)) (v_~back~0_206 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_605) c_~queue~0.base)) (.cse1 (* v_~back~0_206 4))) (or (not (= (+ (select .cse0 (+ .cse1 c_~queue~0.offset)) 1) 0)) (forall ((~front~0 Int)) (or (<= v_~back~0_206 ~front~0) (< ~front~0 0) (<= 0 (let ((.cse2 (* ~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse2 4)) (select .cse0 (+ c_~queue~0.offset .cse2))))))) (not (= (select .cse0 (+ .cse1 c_~queue~0.offset (- 4))) 1)) (not (< v_~back~0_206 c_~n~0)) (< v_~back~0_206 1)))) (forall ((v_ArrVal_605 (Array Int Int)) (v_~back~0_206 Int)) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_605) c_~queue~0.base)) (.cse5 (* v_~back~0_206 4))) (or (forall ((~front~0 Int)) (or (<= v_~back~0_206 ~front~0) (<= (let ((.cse4 (* ~front~0 4))) (+ c_~sum~0 (select .cse3 (+ c_~queue~0.offset .cse4 4)) (select .cse3 (+ c_~queue~0.offset .cse4)))) 1) (< ~front~0 0))) (not (= (+ (select .cse3 (+ .cse5 c_~queue~0.offset)) 1) 0)) (not (= (select .cse3 (+ .cse5 c_~queue~0.offset (- 4))) 1)) (not (< v_~back~0_206 c_~n~0)) (< v_~back~0_206 1))))) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-12-06 03:14:58,975 WARN L837 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_~back~0_206 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_605) c_~queue~0.base)) (.cse2 (* v_~back~0_206 4))) (or (forall ((~front~0 Int)) (or (<= v_~back~0_206 ~front~0) (<= (let ((.cse1 (* ~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) 1) (< ~front~0 0))) (not (= (+ (select .cse0 (+ .cse2 c_~queue~0.offset)) 1) 0)) (not (< v_~back~0_206 c_~n~0)) (< v_~back~0_206 1) (not (= (select .cse0 (+ .cse2 c_~queue~0.offset (- 4))) 1))))) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_~back~0_206 Int)) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_605) c_~queue~0.base)) (.cse4 (* v_~back~0_206 4))) (or (not (= (+ (select .cse3 (+ .cse4 c_~queue~0.offset)) 1) 0)) (forall ((~front~0 Int)) (or (<= v_~back~0_206 ~front~0) (<= 0 (let ((.cse5 (* ~front~0 4))) (+ c_~sum~0 (select .cse3 (+ c_~queue~0.offset .cse5 4)) (select .cse3 (+ c_~queue~0.offset .cse5))))) (< ~front~0 0))) (not (< v_~back~0_206 c_~n~0)) (< v_~back~0_206 1) (not (= (select .cse3 (+ .cse4 c_~queue~0.offset (- 4))) 1))))))) is different from false [2022-12-06 03:14:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:14:59,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291293173] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:14:59,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:14:59,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2022-12-06 03:14:59,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980009364] [2022-12-06 03:14:59,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:14:59,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 03:14:59,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:14:59,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 03:14:59,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=599, Unknown=2, NotChecked=102, Total=812 [2022-12-06 03:14:59,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 03:14:59,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 12289 transitions, 354358 flow. Second operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 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-06 03:14:59,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:14:59,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 03:14:59,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:15:11,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:15:13,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:15:19,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:15:21,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:16:55,682 INFO L130 PetriNetUnfolder]: 21644/36681 cut-off events. [2022-12-06 03:16:55,683 INFO L131 PetriNetUnfolder]: For 60954/60954 co-relation queries the response was YES. [2022-12-06 03:16:55,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550012 conditions, 36681 events. 21644/36681 cut-off events. For 60954/60954 co-relation queries the response was YES. Maximal size of possible extension queue 1699. Compared 306482 event pairs, 28 based on Foata normal form. 956/36479 useless extension candidates. Maximal degree in co-relation 245774. Up to 23539 conditions per place. [2022-12-06 03:16:55,850 INFO L137 encePairwiseOnDemand]: 10/35 looper letters, 2276 selfloop transitions, 555 changer transitions 9785/12616 dead transitions. [2022-12-06 03:16:55,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 12616 transitions, 389569 flow [2022-12-06 03:16:55,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-06 03:16:55,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-12-06 03:16:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 330 transitions. [2022-12-06 03:16:55,857 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2006079027355623 [2022-12-06 03:16:55,857 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 321 predicate places. [2022-12-06 03:16:55,858 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:16:55,858 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 352 places, 12616 transitions, 389569 flow [2022-12-06 03:16:56,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 352 places, 12616 transitions, 389569 flow [2022-12-06 03:16:56,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:16:59,445 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:16:59,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3589 [2022-12-06 03:16:59,446 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 12615 transitions, 389537 flow [2022-12-06 03:16:59,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 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-06 03:16:59,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:16:59,447 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:16:59,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 03:16:59,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 03:16:59,654 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:16:59,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:16:59,654 INFO L85 PathProgramCache]: Analyzing trace with hash 53804130, now seen corresponding path program 6 times [2022-12-06 03:16:59,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:16:59,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29724941] [2022-12-06 03:16:59,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:16:59,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:16:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:17:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:17:00,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:17:00,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29724941] [2022-12-06 03:17:00,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29724941] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:17:00,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604571924] [2022-12-06 03:17:00,617 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 03:17:00,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:17:00,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:17:00,618 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:17:00,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 03:17:00,875 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-06 03:17:00,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:17:00,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 03:17:00,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:17:00,910 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-06 03:17:00,910 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 22 treesize of output 32 [2022-12-06 03:17:00,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:17:00,917 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 20 treesize of output 22 [2022-12-06 03:17:00,971 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 6 treesize of output 5 [2022-12-06 03:17:01,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:17:01,250 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 44 treesize of output 42 [2022-12-06 03:17:01,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:17:01,309 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 48 treesize of output 14 [2022-12-06 03:17:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:17:01,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:17:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:17:02,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604571924] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:17:02,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:17:02,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2022-12-06 03:17:02,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939414097] [2022-12-06 03:17:02,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:17:02,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-06 03:17:02,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:17:02,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-06 03:17:02,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=817, Unknown=8, NotChecked=0, Total=992 [2022-12-06 03:17:02,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 03:17:02,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 12615 transitions, 389537 flow. Second operand has 32 states, 32 states have (on average 1.84375) internal successors, (59), 31 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-06 03:17:02,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:17:02,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 03:17:02,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:17:03,061 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (let ((.cse0 (+ c_~back~0 1)) (.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (* c_~back~0 4))) (or (= (mod c_~v_assert~0 256) 0) (<= .cse0 c_~front~0) (not (= (+ (select .cse1 (+ c_~queue~0.offset .cse2 4)) 1) 0)) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse1 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse4))))))) (< c_~front~0 0) (not (< .cse0 c_~n~0)) (not (= (select .cse1 (+ c_~queue~0.offset .cse2)) 1))))) is different from false [2022-12-06 03:17:12,788 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-12-06 03:17:12,963 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse0)))) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-12-06 03:17:19,786 WARN L837 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-12-06 03:17:34,437 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse3)) (.cse0 (let ((.cse8 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse8) (not (= (+ .cse9 1) 0))) (or .cse8 (not (= .cse9 1)))))) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (.cse7 (not (< c_~back~0 c_~n~0)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or .cse0 (<= c_~back~0 c_~front~0) (let ((.cse1 (select .cse4 .cse5)) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)))))) .cse6 .cse7 (< c_~front~0 0)) (or (and (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)) 1))) .cse0 .cse6 .cse7 (not (<= 0 c_~back~0)))))) is different from false [2022-12-06 03:17:35,928 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse3)) (.cse0 (let ((.cse8 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse8) (not (= (+ .cse9 1) 0))) (or .cse8 (not (= .cse9 1)))))) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (.cse7 (not (< c_~back~0 c_~n~0)))) (and (or .cse0 (<= c_~back~0 c_~front~0) (let ((.cse1 (select .cse4 .cse5)) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)))))) .cse6 .cse7 (< c_~front~0 0)) (or (and (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)) 1))) .cse0 .cse6 .cse7 (not (<= 0 c_~back~0))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)))) is different from false [2022-12-06 03:17:48,369 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse3)) (.cse0 (let ((.cse8 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse8) (not (= (+ .cse9 1) 0))) (or .cse8 (not (= .cse9 1)))))) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (.cse7 (not (< c_~back~0 c_~n~0)))) (and (or .cse0 (<= c_~back~0 c_~front~0) (let ((.cse1 (select .cse4 .cse5)) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)))))) .cse6 .cse7 (< c_~front~0 0)) (or (and (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)) 1))) .cse0 .cse6 .cse7 (not (<= 0 c_~back~0)))))) is different from false [2022-12-06 03:18:04,982 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 81 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:19:06,301 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse3)) (.cse0 (let ((.cse8 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse8) (not (= (+ .cse9 1) 0))) (or .cse8 (not (= .cse9 1)))))) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (.cse7 (not (< c_~back~0 c_~n~0)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or .cse0 (<= c_~back~0 c_~front~0) (let ((.cse1 (select .cse4 .cse5)) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)))))) .cse6 .cse7 (< c_~front~0 0)) (or (and (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)) 1))) .cse0 .cse6 .cse7 (not (<= 0 c_~back~0))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)))) is different from false [2022-12-06 03:19:06,334 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse3)) (.cse0 (let ((.cse8 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse8) (not (= (+ .cse9 1) 0))) (or .cse8 (not (= .cse9 1)))))) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (.cse7 (not (< c_~back~0 c_~n~0)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or .cse0 (<= c_~back~0 c_~front~0) (let ((.cse1 (select .cse4 .cse5)) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)))))) .cse6 .cse7 (< c_~front~0 0)) (or (and (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)) 1))) .cse0 .cse6 .cse7 (not (<= 0 c_~back~0))) (<= 0 c_~sum~0) (<= c_~sum~0 1)))) is different from false [2022-12-06 03:19:06,374 WARN L837 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-12-06 03:19:34,364 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse3)) (.cse0 (let ((.cse8 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse8) (not (= (+ .cse9 1) 0))) (or .cse8 (not (= .cse9 1)))))) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (.cse7 (not (< c_~back~0 c_~n~0)))) (and (or .cse0 (<= c_~back~0 c_~front~0) (let ((.cse1 (select .cse4 .cse5)) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)))))) .cse6 .cse7 (< c_~front~0 0)) (or (and (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)) 1))) .cse0 .cse6 .cse7 (not (<= 0 c_~back~0))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)))) is different from false [2022-12-06 03:19:34,418 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse3)) (.cse0 (let ((.cse8 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse8) (not (= (+ .cse9 1) 0))) (or .cse8 (not (= .cse9 1)))))) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (.cse7 (not (< c_~back~0 c_~n~0)))) (and (or .cse0 (<= c_~back~0 c_~front~0) (let ((.cse1 (select .cse4 .cse5)) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)))))) .cse6 .cse7 (< c_~front~0 0)) (or (and (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)) 1))) .cse0 .cse6 .cse7 (not (<= 0 c_~back~0))) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)))) is different from false [2022-12-06 03:19:34,465 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse3)) (.cse0 (let ((.cse8 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse8) (not (= (+ .cse9 1) 0))) (or .cse8 (not (= .cse9 1)))))) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (.cse7 (not (< c_~back~0 c_~n~0)))) (and (or .cse0 (<= c_~back~0 c_~front~0) (let ((.cse1 (select .cse4 .cse5)) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)))))) .cse6 .cse7 (< c_~front~0 0)) (or (and (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)) 1))) .cse0 .cse6 .cse7 (not (<= 0 c_~back~0))) (<= 0 c_~sum~0) (<= c_~sum~0 1)))) is different from false [2022-12-06 03:20:34,229 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~front~0 4))) (let ((.cse8 (select |c_#memory_int| c_~queue~0.base)) (.cse10 (+ c_~queue~0.offset .cse6))) (let ((.cse9 (select .cse8 .cse10))) (let ((.cse1 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse2 (= c_~sum~0 0)) (.cse3 (* c_~n~0 4)) (.cse5 (+ c_~sum~0 .cse9)) (.cse0 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256))) (and (<= c_~sum~0 0) (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse0 256)) (let ((.cse4 (+ c_~back~0 1))) (or (and (= c_~back~0 c_~front~0) .cse1 .cse2 (<= .cse3 8)) (<= .cse4 0) (<= c_~n~0 .cse4))) (<= .cse5 1) (or (and (let ((.cse7 (* c_~back~0 4))) (or (and (= (+ .cse6 4) .cse7) .cse1 .cse2 (<= .cse3 (+ .cse7 4))) (not (= (+ (select .cse8 (+ c_~queue~0.offset .cse7)) 1) 0)))) (= .cse9 1)) (<= c_~n~0 c_~back~0)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse10)))) (<= 0 .cse5) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse10)) 1)) (<= 0 c_~sum~0) (not (<= (+ .cse0 1) 0))))))) is different from false [2022-12-06 03:20:47,017 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse3)) (.cse0 (let ((.cse8 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse8) (not (= (+ .cse9 1) 0))) (or .cse8 (not (= .cse9 1)))))) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (.cse7 (not (< c_~back~0 c_~n~0)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or .cse0 (<= c_~back~0 c_~front~0) (let ((.cse1 (select .cse4 .cse5)) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)))))) .cse6 .cse7 (< c_~front~0 0)) (or (and (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)) 1))) .cse0 .cse6 .cse7 (not (<= 0 c_~back~0))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0)))) is different from false [2022-12-06 03:20:47,084 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse3)) (.cse0 (let ((.cse8 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse8) (not (= (+ .cse9 1) 0))) (or .cse8 (not (= .cse9 1)))))) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (.cse7 (not (< c_~back~0 c_~n~0)))) (and (or .cse0 (<= c_~back~0 c_~front~0) (let ((.cse1 (select .cse4 .cse5)) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)))))) .cse6 .cse7 (< c_~front~0 0)) (or (and (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)) 1))) .cse0 .cse6 .cse7 (not (<= 0 c_~back~0))) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0)))) is different from false [2022-12-06 03:21:35,316 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse6))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse0)) 1)) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0) (<= c_~back~0 c_~front~0) (let ((.cse4 (select .cse3 .cse0)) (.cse5 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)) 1)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)))))) (not (< c_~back~0 c_~n~0)) (< c_~front~0 0)))))) is different from false [2022-12-06 03:22:57,580 WARN L837 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= c_~sum~0 0) (<= 0 c_~sum~0)) is different from false [2022-12-06 03:23:17,976 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse3)) (.cse0 (let ((.cse8 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse8) (not (= (+ .cse9 1) 0))) (or .cse8 (not (= .cse9 1)))))) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (.cse7 (not (< c_~back~0 c_~n~0)))) (and (or .cse0 (<= c_~back~0 c_~front~0) (let ((.cse1 (select .cse4 .cse5)) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse2)))))) .cse6 .cse7 (< c_~front~0 0)) (or (and (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse5)) 1))) .cse0 .cse6 .cse7 (not (<= 0 c_~back~0))) (<= c_~sum~0 0) (<= 0 c_~sum~0)))) is different from false [2022-12-06 03:23:18,005 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (<= c_~sum~0 0) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse0)) 1)) (<= 0 c_~sum~0))) is different from false [2022-12-06 03:23:30,391 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~front~0 4))) (let ((.cse6 (+ c_~queue~0.offset .cse5))) (and (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~back~0 c_~front~0) (let ((.cse3 (select .cse2 .cse6)) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse4)))))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< c_~back~0 c_~n~0)) (< c_~front~0 0))) (<= c_~sum~0 0) (forall ((v_ArrVal_663 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse6)))) (forall ((v_ArrVal_663 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_663) c_~queue~0.base) .cse6)) 1)) (<= 0 c_~sum~0)))) is different from false [2022-12-06 03:23:40,183 INFO L130 PetriNetUnfolder]: 67035/115600 cut-off events. [2022-12-06 03:23:40,184 INFO L131 PetriNetUnfolder]: For 180066/180066 co-relation queries the response was YES. [2022-12-06 03:23:40,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849882 conditions, 115600 events. 67035/115600 cut-off events. For 180066/180066 co-relation queries the response was YES. Maximal size of possible extension queue 3460. Compared 1101831 event pairs, 50 based on Foata normal form. 1992/111303 useless extension candidates. Maximal degree in co-relation 1111155. Up to 74895 conditions per place. [2022-12-06 03:23:40,789 INFO L137 encePairwiseOnDemand]: 4/36 looper letters, 8451 selfloop transitions, 4212 changer transitions 34771/47434 dead transitions. [2022-12-06 03:23:40,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 47434 transitions, 1549288 flow [2022-12-06 03:23:40,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2022-12-06 03:23:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2022-12-06 03:23:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1689 transitions. [2022-12-06 03:23:40,796 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19387052341597796 [2022-12-06 03:23:40,796 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 556 predicate places. [2022-12-06 03:23:40,796 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:23:40,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 587 places, 47434 transitions, 1549288 flow [2022-12-06 03:23:43,703 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 587 places, 47434 transitions, 1549288 flow [2022-12-06 03:23:43,703 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:23:43,735 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [514] L110-4-->L111-3: Formula: (and (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre12#1_25| |v_#pthreadsForks_47|) (= (store |v_#memory_int_114| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_114| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre12#1_25|)) |v_#memory_int_113|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_25|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] and [380] $Ultimate##0-->L59: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] [2022-12-06 03:23:43,898 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [425] $Ultimate##0-->L86: Formula: (and (= |v_thread2Thread1of1ForFork2_~cond~1#1_11| v_~v_assert~0_8) (= |v_thread2Thread1of1ForFork2_~b~0#1_13| 1)) InVars {~v_assert~0=v_~v_assert~0_8} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_11|, ~v_assert~0=v_~v_assert~0_8, thread2Thread1of1ForFork2_~b~0#1=|v_thread2Thread1of1ForFork2_~b~0#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1] and [497] L111-4-->L112-3: Formula: (and (= (store |v_#memory_int_100| |v_ULTIMATE.start_main_~#t3~0#1.base_13| (store (select |v_#memory_int_100| |v_ULTIMATE.start_main_~#t3~0#1.base_13|) |v_ULTIMATE.start_main_~#t3~0#1.offset_13| |v_ULTIMATE.start_main_#t~pre14#1_15|)) |v_#memory_int_99|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (= |v_ULTIMATE.start_main_#t~pre14#1_15| |v_#pthreadsForks_43|)) InVars {#pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_13|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_13|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_19|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_15|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_13|, #memory_int=|v_#memory_int_99|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_9|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 03:23:43,925 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [380] $Ultimate##0-->L59: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] and [514] L110-4-->L111-3: Formula: (and (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre12#1_25| |v_#pthreadsForks_47|) (= (store |v_#memory_int_114| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_114| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre12#1_25|)) |v_#memory_int_113|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_25|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 03:23:44,082 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:23:44,083 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3287 [2022-12-06 03:23:44,083 INFO L495 AbstractCegarLoop]: Abstraction has has 585 places, 47432 transitions, 1549238 flow [2022-12-06 03:23:44,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.84375) internal successors, (59), 31 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-06 03:23:44,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:23:44,084 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:23:44,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 03:23:44,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 03:23:44,292 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:23:44,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:23:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1143768118, now seen corresponding path program 7 times [2022-12-06 03:23:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:23:44,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98817907] [2022-12-06 03:23:44,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:23:44,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:23:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:23:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:23:45,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:23:45,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98817907] [2022-12-06 03:23:45,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98817907] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:23:45,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354455117] [2022-12-06 03:23:45,319 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 03:23:45,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:23:45,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:23:45,321 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:23:45,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 03:23:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:23:45,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 03:23:45,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:23:45,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:23:45,729 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 44 treesize of output 42 [2022-12-06 03:23:45,796 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:23:45,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 14 [2022-12-06 03:23:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:23:45,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:23:45,953 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_716 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse0) c_~sum~0) 1)) (forall ((v_ArrVal_716 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse0) c_~sum~0))))) is different from false [2022-12-06 03:23:45,966 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_716 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_716 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)) 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-06 03:23:45,996 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_716 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_716 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)) 1))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-12-06 03:23:46,097 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-06 03:23:46,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 240 [2022-12-06 03:23:46,107 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 59 treesize of output 52 [2022-12-06 03:23:46,116 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 52 treesize of output 45 [2022-12-06 03:23:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-06 03:23:46,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354455117] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:23:46,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:23:46,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 27 [2022-12-06 03:23:46,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138757962] [2022-12-06 03:23:46,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:23:46,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 03:23:46,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:23:46,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 03:23:46,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=490, Unknown=3, NotChecked=144, Total=756 [2022-12-06 03:23:46,726 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 03:23:46,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 47432 transitions, 1549238 flow. Second operand has 28 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:23:46,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:23:46,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 03:23:46,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:23:48,511 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_716 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_716 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)) 1))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-12-06 03:23:48,601 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_716 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_716 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)) 1))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-12-06 03:24:06,323 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (forall ((v_ArrVal_716 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse0) c_~sum~0) 1)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (forall ((v_ArrVal_716 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse0) c_~sum~0))) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0))) is different from false [2022-12-06 03:24:12,535 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_716 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_716 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)) 1))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0)) is different from false [2022-12-06 03:24:17,777 WARN L837 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_716 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_716 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)) 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-12-06 03:25:22,412 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_716 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_716 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)) 1))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-12-06 03:26:36,597 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_716 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_716 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_716) c_~queue~0.base) .cse1)) 1))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false Received shutdown request... [2022-12-06 03:26:46,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-12-06 03:26:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 03:26:46,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 03:26:46,492 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:26:46,492 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-06 03:26:46,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 03:26:46,669 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (28states, 0/40 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 189003 conditions, 11043 events (5890/11042 cut-off events. For 22504/22504 co-relation queries the response was YES. Maximal size of possible extension queue 3308. Compared 112345 event pairs, 34 based on Foata normal form. 0/14329 useless extension candidates. Maximal degree in co-relation 65057. Up to 7115 conditions per place.). [2022-12-06 03:26:46,670 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 03:26:46,670 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 03:26:46,670 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 03:26:46,671 INFO L458 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1, 1, 1, 1] [2022-12-06 03:26:46,674 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 03:26:46,674 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 03:26:46,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 03:26:46 BasicIcfg [2022-12-06 03:26:46,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 03:26:46,679 INFO L158 Benchmark]: Toolchain (without parser) took 806712.27ms. Allocated memory was 204.5MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 180.6MB in the beginning and 1.2GB in the end (delta: -985.8MB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2022-12-06 03:26:46,680 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 204.5MB. Free memory is still 181.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:26:46,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.50ms. Allocated memory is still 204.5MB. Free memory was 180.2MB in the beginning and 166.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 03:26:46,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.67ms. Allocated memory is still 204.5MB. Free memory was 166.6MB in the beginning and 164.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:26:46,681 INFO L158 Benchmark]: Boogie Preprocessor took 47.22ms. Allocated memory is still 204.5MB. Free memory was 164.5MB in the beginning and 162.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:26:46,681 INFO L158 Benchmark]: RCFGBuilder took 511.14ms. Allocated memory is still 204.5MB. Free memory was 162.9MB in the beginning and 141.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 03:26:46,682 INFO L158 Benchmark]: TraceAbstraction took 805813.62ms. Allocated memory was 204.5MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 140.9MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2022-12-06 03:26:46,683 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 204.5MB. Free memory is still 181.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 276.50ms. Allocated memory is still 204.5MB. Free memory was 180.2MB in the beginning and 166.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.67ms. Allocated memory is still 204.5MB. Free memory was 166.6MB in the beginning and 164.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.22ms. Allocated memory is still 204.5MB. Free memory was 164.5MB in the beginning and 162.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 511.14ms. Allocated memory is still 204.5MB. Free memory was 162.9MB in the beginning and 141.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 805813.62ms. Allocated memory was 204.5MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 140.9MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 119 PlacesBefore, 31 PlacesAfterwards, 119 TransitionsBefore, 24 TransitionsAfterwards, 1262 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 30 ConcurrentYvCompositions, 7 ChoiceCompositions, 95 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 733, independent: 715, independent conditional: 715, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 733, independent: 715, independent conditional: 0, independent unconditional: 715, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 733, independent: 715, independent conditional: 0, independent unconditional: 715, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 733, independent: 715, independent conditional: 0, independent unconditional: 715, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 630, independent: 616, independent conditional: 0, independent unconditional: 616, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 630, independent: 616, independent conditional: 0, independent unconditional: 616, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 733, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 630, unknown conditional: 0, unknown unconditional: 630] , Statistics on independence cache: Total cache size (in pairs): 992, Positive cache size: 978, Positive conditional cache size: 0, Positive unconditional cache size: 978, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 153 TransitionsBefore, 153 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 153 TransitionsBefore, 153 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 49 PlacesBefore, 48 PlacesAfterwards, 195 TransitionsBefore, 194 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 73 PlacesBefore, 71 PlacesAfterwards, 423 TransitionsBefore, 421 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 90 PlacesBefore, 89 PlacesAfterwards, 693 TransitionsBefore, 692 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 120 PlacesBefore, 120 PlacesAfterwards, 1239 TransitionsBefore, 1239 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 146 PlacesBefore, 146 PlacesAfterwards, 1535 TransitionsBefore, 1535 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 162 PlacesBefore, 162 PlacesAfterwards, 1603 TransitionsBefore, 1603 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 165 PlacesBefore, 165 PlacesAfterwards, 2675 TransitionsBefore, 2675 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 192 PlacesBefore, 192 PlacesAfterwards, 3621 TransitionsBefore, 3621 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 219 PlacesBefore, 219 PlacesAfterwards, 4030 TransitionsBefore, 4030 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 307 PlacesBefore, 306 PlacesAfterwards, 12290 TransitionsBefore, 12289 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 352 PlacesBefore, 351 PlacesAfterwards, 12616 TransitionsBefore, 12615 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 587 PlacesBefore, 585 PlacesAfterwards, 47434 TransitionsBefore, 47432 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (28states, 0/40 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 189003 conditions, 11043 events (5890/11042 cut-off events. For 22504/22504 co-relation queries the response was YES. Maximal size of possible extension queue 3308. Compared 112345 event pairs, 34 based on Foata normal form. 0/14329 useless extension candidates. Maximal degree in co-relation 65057. Up to 7115 conditions per place.). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (28states, 0/40 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 189003 conditions, 11043 events (5890/11042 cut-off events. For 22504/22504 co-relation queries the response was YES. Maximal size of possible extension queue 3308. Compared 112345 event pairs, 34 based on Foata normal form. 0/14329 useless extension candidates. Maximal degree in co-relation 65057. Up to 7115 conditions per place.). - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (28states, 0/40 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 189003 conditions, 11043 events (5890/11042 cut-off events. For 22504/22504 co-relation queries the response was YES. Maximal size of possible extension queue 3308. Compared 112345 event pairs, 34 based on Foata normal form. 0/14329 useless extension candidates. Maximal degree in co-relation 65057. Up to 7115 conditions per place.). - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (28states, 0/40 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 189003 conditions, 11043 events (5890/11042 cut-off events. For 22504/22504 co-relation queries the response was YES. Maximal size of possible extension queue 3308. Compared 112345 event pairs, 34 based on Foata normal form. 0/14329 useless extension candidates. Maximal degree in co-relation 65057. Up to 7115 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 154 locations, 4 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: 805.7s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 759.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 573 mSolverCounterUnknown, 5918 SdHoareTripleChecker+Valid, 24.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5918 mSDsluCounter, 158 SdHoareTripleChecker+Invalid, 22.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1580 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 1410 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14763 IncrementalHoareTripleChecker+Invalid, 18326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1410 mSolverCounterUnsat, 7 mSDtfsCounter, 14763 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1202 GetRequests, 332 SyntacticMatches, 42 SemanticMatches, 828 ConstructedPredicates, 38 IntricatePredicates, 0 DeprecatedPredicates, 33054 ImplicationChecksByTransitivity, 97.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1549288occurred in iteration=16, InterpolantAutomatonStates: 591, 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.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 859 ConstructedInterpolants, 41 QuantifiedInterpolants, 15481 SizeOfPredicates, 261 NumberOfNonLiveVariables, 2538 ConjunctsInSsa, 425 ConjunctsInUnsatCore, 39 InterpolantComputations, 6 PerfectInterpolantSequences, 54/152 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