/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:19:57,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:19:57,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:19:57,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:19:57,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:19:57,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:19:57,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:19:57,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:19:57,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:19:57,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:19:57,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:19:57,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:19:57,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:19:57,415 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:19:57,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:19:57,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:19:57,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:19:57,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:19:57,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:19:57,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:19:57,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:19:57,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:19:57,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:19:57,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:19:57,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:19:57,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:19:57,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:19:57,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:19:57,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:19:57,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:19:57,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:19:57,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:19:57,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:19:57,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:19:57,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:19:57,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:19:57,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:19:57,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:19:57,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:19:57,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:19:57,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:19:57,445 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 00:19:57,477 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:19:57,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:19:57,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:19:57,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:19:57,479 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:19:57,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:19:57,480 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:19:57,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:19:57,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:19:57,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:19:57,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:19:57,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:19:57,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:19:57,482 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:19:57,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:19:57,482 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:19:57,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:19:57,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:19:57,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:19:57,483 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:19:57,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:19:57,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:19:57,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:19:57,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:19:57,483 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:19:57,483 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:19:57,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:19:57,484 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:19:57,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 00:19:57,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:19:57,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:19:57,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:19:57,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:19:57,842 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:19:57,843 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2022-12-06 00:19:59,014 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:19:59,222 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:19:59,222 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2022-12-06 00:19:59,228 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b49ac4e6/9ef27694e81b4b1d9a3bd90b8c72fcc9/FLAGb1c6fc157 [2022-12-06 00:19:59,242 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b49ac4e6/9ef27694e81b4b1d9a3bd90b8c72fcc9 [2022-12-06 00:19:59,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:19:59,245 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:19:59,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:19:59,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:19:59,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:19:59,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:19:59" (1/1) ... [2022-12-06 00:19:59,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5877c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:59, skipping insertion in model container [2022-12-06 00:19:59,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:19:59" (1/1) ... [2022-12-06 00:19:59,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:19:59,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:19:59,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:59,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:59,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:59,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:59,419 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-more-nonblocking-counter-alt2.wvr.c[2147,2160] [2022-12-06 00:19:59,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:19:59,428 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:19:59,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:59,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:59,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:59,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:59,449 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-more-nonblocking-counter-alt2.wvr.c[2147,2160] [2022-12-06 00:19:59,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:19:59,462 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:19:59,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:59 WrapperNode [2022-12-06 00:19:59,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:19:59,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:19:59,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:19:59,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:19:59,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:59" (1/1) ... [2022-12-06 00:19:59,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:59" (1/1) ... [2022-12-06 00:19:59,487 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2022-12-06 00:19:59,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:19:59,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:19:59,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:19:59,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:19:59,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:59" (1/1) ... [2022-12-06 00:19:59,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:59" (1/1) ... [2022-12-06 00:19:59,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:59" (1/1) ... [2022-12-06 00:19:59,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:59" (1/1) ... [2022-12-06 00:19:59,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:59" (1/1) ... [2022-12-06 00:19:59,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:59" (1/1) ... [2022-12-06 00:19:59,514 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:59" (1/1) ... [2022-12-06 00:19:59,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:59" (1/1) ... [2022-12-06 00:19:59,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:19:59,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:19:59,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:19:59,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:19:59,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:59" (1/1) ... [2022-12-06 00:19:59,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:19:59,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:19:59,553 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 00:19:59,563 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 00:19:59,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:19:59,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:19:59,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:19:59,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:19:59,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:19:59,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:19:59,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:19:59,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:19:59,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:19:59,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:19:59,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:19:59,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:19:59,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:19:59,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:19:59,588 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 00:19:59,662 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:19:59,664 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:19:59,871 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:19:59,928 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:19:59,928 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 00:19:59,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:19:59 BoogieIcfgContainer [2022-12-06 00:19:59,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:19:59,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:19:59,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:19:59,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:19:59,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:19:59" (1/3) ... [2022-12-06 00:19:59,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b5cba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:19:59, skipping insertion in model container [2022-12-06 00:19:59,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:59" (2/3) ... [2022-12-06 00:19:59,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b5cba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:19:59, skipping insertion in model container [2022-12-06 00:19:59,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:19:59" (3/3) ... [2022-12-06 00:19:59,950 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-nonblocking-counter-alt2.wvr.c [2022-12-06 00:19:59,981 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:19:59,981 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:19:59,982 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:20:00,042 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 00:20:00,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 170 flow [2022-12-06 00:20:00,143 INFO L130 PetriNetUnfolder]: 6/75 cut-off events. [2022-12-06 00:20:00,143 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:20:00,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 75 events. 6/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2022-12-06 00:20:00,153 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 170 flow [2022-12-06 00:20:00,158 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 67 transitions, 146 flow [2022-12-06 00:20:00,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:00,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 67 transitions, 146 flow [2022-12-06 00:20:00,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 146 flow [2022-12-06 00:20:00,214 INFO L130 PetriNetUnfolder]: 6/67 cut-off events. [2022-12-06 00:20:00,215 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:20:00,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 67 events. 6/67 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2022-12-06 00:20:00,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 67 transitions, 146 flow [2022-12-06 00:20:00,217 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 00:20:03,440 INFO L203 LiptonReduction]: Total number of compositions: 52 [2022-12-06 00:20:03,459 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:20:03,473 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;@59532013, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:20:03,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 00:20:03,478 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-06 00:20:03,478 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:20:03,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:03,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:03,480 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:20:03,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:03,484 INFO L85 PathProgramCache]: Analyzing trace with hash 791724945, now seen corresponding path program 1 times [2022-12-06 00:20:03,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:03,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243171433] [2022-12-06 00:20:03,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:03,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:04,034 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 00:20:04,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:04,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243171433] [2022-12-06 00:20:04,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243171433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:04,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:04,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:20:04,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69759164] [2022-12-06 00:20:04,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:04,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:20:04,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:04,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:20:04,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:20:04,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-06 00:20:04,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 00:20:04,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:04,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-06 00:20:04,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:04,184 INFO L130 PetriNetUnfolder]: 63/112 cut-off events. [2022-12-06 00:20:04,184 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 00:20:04,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 112 events. 63/112 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 325 event pairs, 13 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 163. Up to 66 conditions per place. [2022-12-06 00:20:04,188 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 17 selfloop transitions, 2 changer transitions 4/25 dead transitions. [2022-12-06 00:20:04,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 25 transitions, 117 flow [2022-12-06 00:20:04,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:20:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:20:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 00:20:04,198 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 00:20:04,199 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 3 states and 30 transitions. [2022-12-06 00:20:04,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 25 transitions, 117 flow [2022-12-06 00:20:04,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 25 transitions, 103 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 00:20:04,217 INFO L231 Difference]: Finished difference. Result has 19 places, 16 transitions, 46 flow [2022-12-06 00:20:04,219 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=19, PETRI_TRANSITIONS=16} [2022-12-06 00:20:04,222 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2022-12-06 00:20:04,223 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:04,223 INFO L89 Accepts]: Start accepts. Operand has 19 places, 16 transitions, 46 flow [2022-12-06 00:20:04,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:04,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:04,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 16 transitions, 46 flow [2022-12-06 00:20:04,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 46 flow [2022-12-06 00:20:04,253 INFO L130 PetriNetUnfolder]: 2/20 cut-off events. [2022-12-06 00:20:04,253 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:20:04,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 2/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 4 conditions per place. [2022-12-06 00:20:04,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 16 transitions, 46 flow [2022-12-06 00:20:04,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 00:20:04,255 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:04,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 00:20:04,257 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 16 transitions, 46 flow [2022-12-06 00:20:04,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 00:20:04,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:04,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:04,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:20:04,262 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:20:04,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:04,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1574486509, now seen corresponding path program 1 times [2022-12-06 00:20:04,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:04,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409566259] [2022-12-06 00:20:04,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:04,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:04,484 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 00:20:04,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:04,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409566259] [2022-12-06 00:20:04,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409566259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:04,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:04,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:20:04,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027356785] [2022-12-06 00:20:04,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:04,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:20:04,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:04,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:20:04,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:20:04,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 00:20:04,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 16 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 00:20:04,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:04,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 00:20:04,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:04,611 INFO L130 PetriNetUnfolder]: 102/196 cut-off events. [2022-12-06 00:20:04,611 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 00:20:04,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 196 events. 102/196 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 648 event pairs, 46 based on Foata normal form. 6/174 useless extension candidates. Maximal degree in co-relation 214. Up to 125 conditions per place. [2022-12-06 00:20:04,613 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 28 selfloop transitions, 3 changer transitions 6/37 dead transitions. [2022-12-06 00:20:04,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 37 transitions, 174 flow [2022-12-06 00:20:04,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:20:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:20:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-06 00:20:04,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-06 00:20:04,616 INFO L175 Difference]: Start difference. First operand has 19 places, 16 transitions, 46 flow. Second operand 5 states and 37 transitions. [2022-12-06 00:20:04,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 37 transitions, 174 flow [2022-12-06 00:20:04,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 37 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:20:04,618 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 70 flow [2022-12-06 00:20:04,618 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2022-12-06 00:20:04,618 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2022-12-06 00:20:04,619 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:04,619 INFO L89 Accepts]: Start accepts. Operand has 25 places, 18 transitions, 70 flow [2022-12-06 00:20:04,620 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:04,620 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:04,620 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 18 transitions, 70 flow [2022-12-06 00:20:04,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 70 flow [2022-12-06 00:20:04,626 INFO L130 PetriNetUnfolder]: 2/27 cut-off events. [2022-12-06 00:20:04,627 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:20:04,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 27 events. 2/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 50 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 30. Up to 7 conditions per place. [2022-12-06 00:20:04,628 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 70 flow [2022-12-06 00:20:04,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 00:20:05,076 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:05,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 458 [2022-12-06 00:20:05,077 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 67 flow [2022-12-06 00:20:05,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 00:20:05,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:05,078 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:05,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:20:05,078 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:20:05,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:05,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1833465912, now seen corresponding path program 1 times [2022-12-06 00:20:05,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:05,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587463065] [2022-12-06 00:20:05,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:05,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:05,175 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 00:20:05,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:05,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587463065] [2022-12-06 00:20:05,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587463065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:05,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:05,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:20:05,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620311361] [2022-12-06 00:20:05,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:05,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:20:05,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:05,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:20:05,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:20:05,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 00:20:05,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 00:20:05,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:05,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 00:20:05,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:05,226 INFO L130 PetriNetUnfolder]: 57/106 cut-off events. [2022-12-06 00:20:05,226 INFO L131 PetriNetUnfolder]: For 201/208 co-relation queries the response was YES. [2022-12-06 00:20:05,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 106 events. 57/106 cut-off events. For 201/208 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 272 event pairs, 37 based on Foata normal form. 12/106 useless extension candidates. Maximal degree in co-relation 147. Up to 105 conditions per place. [2022-12-06 00:20:05,231 INFO L137 encePairwiseOnDemand]: 14/16 looper letters, 14 selfloop transitions, 1 changer transitions 0/16 dead transitions. [2022-12-06 00:20:05,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 16 transitions, 90 flow [2022-12-06 00:20:05,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:20:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:20:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-12-06 00:20:05,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 00:20:05,232 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 67 flow. Second operand 3 states and 18 transitions. [2022-12-06 00:20:05,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 16 transitions, 90 flow [2022-12-06 00:20:05,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 16 transitions, 74 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 00:20:05,235 INFO L231 Difference]: Finished difference. Result has 20 places, 16 transitions, 46 flow [2022-12-06 00:20:05,235 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=20, PETRI_TRANSITIONS=16} [2022-12-06 00:20:05,236 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 0 predicate places. [2022-12-06 00:20:05,236 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:05,236 INFO L89 Accepts]: Start accepts. Operand has 20 places, 16 transitions, 46 flow [2022-12-06 00:20:05,237 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:05,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:05,238 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 16 transitions, 46 flow [2022-12-06 00:20:05,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 46 flow [2022-12-06 00:20:05,241 INFO L130 PetriNetUnfolder]: 2/20 cut-off events. [2022-12-06 00:20:05,241 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:20:05,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 2/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 24. Up to 4 conditions per place. [2022-12-06 00:20:05,242 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 16 transitions, 46 flow [2022-12-06 00:20:05,242 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 00:20:05,243 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:05,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 00:20:05,244 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 16 transitions, 46 flow [2022-12-06 00:20:05,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 00:20:05,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:05,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:05,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:20:05,245 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:20:05,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:05,246 INFO L85 PathProgramCache]: Analyzing trace with hash 460243900, now seen corresponding path program 1 times [2022-12-06 00:20:05,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:05,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214864523] [2022-12-06 00:20:05,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:05,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:05,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:05,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214864523] [2022-12-06 00:20:05,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214864523] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:20:05,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668789639] [2022-12-06 00:20:05,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:05,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:20:05,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:20:05,599 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 00:20:05,611 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 00:20:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:05,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 00:20:05,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:20:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:05,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:20:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:06,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668789639] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:20:06,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:20:06,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 00:20:06,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229134001] [2022-12-06 00:20:06,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:20:06,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:20:06,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:06,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:20:06,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:20:06,390 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 00:20:06,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 46 flow. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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 00:20:06,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:06,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 00:20:06,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:06,924 INFO L130 PetriNetUnfolder]: 138/250 cut-off events. [2022-12-06 00:20:06,925 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 00:20:06,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 250 events. 138/250 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 857 event pairs, 4 based on Foata normal form. 6/218 useless extension candidates. Maximal degree in co-relation 542. Up to 68 conditions per place. [2022-12-06 00:20:06,926 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 42 selfloop transitions, 18 changer transitions 17/77 dead transitions. [2022-12-06 00:20:06,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 77 transitions, 350 flow [2022-12-06 00:20:06,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:20:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:20:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-12-06 00:20:06,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2022-12-06 00:20:06,928 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 46 flow. Second operand 11 states and 80 transitions. [2022-12-06 00:20:06,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 77 transitions, 350 flow [2022-12-06 00:20:06,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 77 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:20:06,930 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 160 flow [2022-12-06 00:20:06,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=45, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=160, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2022-12-06 00:20:06,931 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 15 predicate places. [2022-12-06 00:20:06,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:06,931 INFO L89 Accepts]: Start accepts. Operand has 35 places, 30 transitions, 160 flow [2022-12-06 00:20:06,932 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:06,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:06,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 30 transitions, 160 flow [2022-12-06 00:20:06,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 30 transitions, 160 flow [2022-12-06 00:20:06,938 INFO L130 PetriNetUnfolder]: 16/66 cut-off events. [2022-12-06 00:20:06,938 INFO L131 PetriNetUnfolder]: For 27/28 co-relation queries the response was YES. [2022-12-06 00:20:06,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 66 events. 16/66 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 226 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 145. Up to 15 conditions per place. [2022-12-06 00:20:06,939 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 30 transitions, 160 flow [2022-12-06 00:20:06,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 00:20:07,130 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:07,130 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:07,431 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] $Ultimate##0-->L54-1: Formula: (and (let ((.cse0 (< 0 (mod v_~counter~0_70 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_29 0) (= |v_thread2Thread1of1ForFork0_#t~post2_19| |v_thread2Thread1of1ForFork0_#t~post2_20|) (not .cse0) (= v_~counter~0_69 v_~counter~0_70)) (and (= v_thread2Thread1of1ForFork0_~i~1_29 1) .cse0 (= (+ v_~counter~0_69 v_~C~0_45) v_~counter~0_70)))) (< 0 (mod v_~M~0_48 4294967296))) InVars {~counter~0=v_~counter~0_70, ~M~0=v_~M~0_48, ~C~0=v_~C~0_45, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_20|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_29, ~counter~0=v_~counter~0_69, ~M~0=v_~M~0_48, ~C~0=v_~C~0_45, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread2Thread1of1ForFork0_#t~post2] and [264] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_56 v_~C~0_33) v_~counter~0_55) (= v_thread1Thread1of1ForFork1_~i~0_31 (+ v_thread1Thread1of1ForFork1_~i~0_32 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_32 4294967296) (mod v_~M~0_30 4294967296))) InVars {~counter~0=v_~counter~0_56, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32} OutVars{~counter~0=v_~counter~0_55, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 00:20:07,575 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:20:07,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 645 [2022-12-06 00:20:07,576 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 164 flow [2022-12-06 00:20:07,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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 00:20:07,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:07,576 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:07,587 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 00:20:07,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:20:07,779 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:20:07,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash 647042430, now seen corresponding path program 2 times [2022-12-06 00:20:07,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:07,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020791624] [2022-12-06 00:20:07,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:07,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:20:07,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:07,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020791624] [2022-12-06 00:20:07,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020791624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:07,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:07,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:20:07,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788922041] [2022-12-06 00:20:07,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:07,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:20:07,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:07,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:20:07,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:20:07,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 00:20:07,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 00:20:07,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:07,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 00:20:07,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:07,937 INFO L130 PetriNetUnfolder]: 122/222 cut-off events. [2022-12-06 00:20:07,938 INFO L131 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2022-12-06 00:20:07,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 222 events. 122/222 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 743 event pairs, 15 based on Foata normal form. 20/242 useless extension candidates. Maximal degree in co-relation 739. Up to 167 conditions per place. [2022-12-06 00:20:07,939 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 32 selfloop transitions, 8 changer transitions 5/46 dead transitions. [2022-12-06 00:20:07,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 313 flow [2022-12-06 00:20:07,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:20:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:20:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 00:20:07,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-06 00:20:07,963 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 164 flow. Second operand 5 states and 44 transitions. [2022-12-06 00:20:07,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 313 flow [2022-12-06 00:20:07,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 286 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 00:20:07,970 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 175 flow [2022-12-06 00:20:07,970 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-06 00:20:07,972 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2022-12-06 00:20:07,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:07,973 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 175 flow [2022-12-06 00:20:07,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:07,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:07,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 175 flow [2022-12-06 00:20:07,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 175 flow [2022-12-06 00:20:07,986 INFO L130 PetriNetUnfolder]: 18/68 cut-off events. [2022-12-06 00:20:07,986 INFO L131 PetriNetUnfolder]: For 48/52 co-relation queries the response was YES. [2022-12-06 00:20:07,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 68 events. 18/68 cut-off events. For 48/52 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 215 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 161. Up to 16 conditions per place. [2022-12-06 00:20:07,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 175 flow [2022-12-06 00:20:07,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 00:20:07,990 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:07,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 00:20:07,992 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 175 flow [2022-12-06 00:20:07,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 00:20:07,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:07,992 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:07,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:20:07,993 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:20:07,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:07,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1731997393, now seen corresponding path program 1 times [2022-12-06 00:20:07,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:07,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256093461] [2022-12-06 00:20:07,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:07,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:20:08,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:08,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256093461] [2022-12-06 00:20:08,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256093461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:08,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:08,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:20:08,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037019749] [2022-12-06 00:20:08,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:08,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:20:08,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:08,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:20:08,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:20:08,085 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 00:20:08,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 00:20:08,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:08,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 00:20:08,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:08,178 INFO L130 PetriNetUnfolder]: 167/309 cut-off events. [2022-12-06 00:20:08,178 INFO L131 PetriNetUnfolder]: For 383/383 co-relation queries the response was YES. [2022-12-06 00:20:08,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 309 events. 167/309 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1118 event pairs, 63 based on Foata normal form. 6/315 useless extension candidates. Maximal degree in co-relation 1080. Up to 132 conditions per place. [2022-12-06 00:20:08,180 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 44 selfloop transitions, 6 changer transitions 4/54 dead transitions. [2022-12-06 00:20:08,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 391 flow [2022-12-06 00:20:08,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:20:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:20:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 00:20:08,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 00:20:08,182 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 175 flow. Second operand 4 states and 42 transitions. [2022-12-06 00:20:08,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 391 flow [2022-12-06 00:20:08,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 361 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 00:20:08,186 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 184 flow [2022-12-06 00:20:08,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-06 00:20:08,187 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 19 predicate places. [2022-12-06 00:20:08,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:08,187 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 184 flow [2022-12-06 00:20:08,188 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:08,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:08,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 184 flow [2022-12-06 00:20:08,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 184 flow [2022-12-06 00:20:08,195 INFO L130 PetriNetUnfolder]: 18/77 cut-off events. [2022-12-06 00:20:08,196 INFO L131 PetriNetUnfolder]: For 59/62 co-relation queries the response was YES. [2022-12-06 00:20:08,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 77 events. 18/77 cut-off events. For 59/62 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 285 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 188. Up to 18 conditions per place. [2022-12-06 00:20:08,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 184 flow [2022-12-06 00:20:08,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 00:20:08,198 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:08,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 00:20:08,199 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 184 flow [2022-12-06 00:20:08,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 00:20:08,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:08,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:08,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:20:08,200 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:20:08,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1330860404, now seen corresponding path program 1 times [2022-12-06 00:20:08,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:08,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763386482] [2022-12-06 00:20:08,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:08,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:08,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:08,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763386482] [2022-12-06 00:20:08,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763386482] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:20:08,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599958695] [2022-12-06 00:20:08,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:08,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:20:08,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:20:08,547 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 00:20:08,591 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 00:20:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:08,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 00:20:08,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:20:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:08,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:20:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:09,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599958695] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:20:09,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:20:09,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 00:20:09,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204564776] [2022-12-06 00:20:09,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:20:09,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:20:09,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:09,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:20:09,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:20:09,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:20:09,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 184 flow. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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 00:20:09,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:09,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:20:09,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:10,238 INFO L130 PetriNetUnfolder]: 323/588 cut-off events. [2022-12-06 00:20:10,238 INFO L131 PetriNetUnfolder]: For 699/699 co-relation queries the response was YES. [2022-12-06 00:20:10,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1964 conditions, 588 events. 323/588 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2549 event pairs, 31 based on Foata normal form. 3/591 useless extension candidates. Maximal degree in co-relation 1948. Up to 195 conditions per place. [2022-12-06 00:20:10,242 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 60 selfloop transitions, 32 changer transitions 20/112 dead transitions. [2022-12-06 00:20:10,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 112 transitions, 707 flow [2022-12-06 00:20:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:20:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:20:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-12-06 00:20:10,246 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4291497975708502 [2022-12-06 00:20:10,246 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 184 flow. Second operand 13 states and 106 transitions. [2022-12-06 00:20:10,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 112 transitions, 707 flow [2022-12-06 00:20:10,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 112 transitions, 699 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 00:20:10,252 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 403 flow [2022-12-06 00:20:10,252 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=403, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2022-12-06 00:20:10,252 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2022-12-06 00:20:10,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:10,253 INFO L89 Accepts]: Start accepts. Operand has 56 places, 50 transitions, 403 flow [2022-12-06 00:20:10,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:10,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:10,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 50 transitions, 403 flow [2022-12-06 00:20:10,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 403 flow [2022-12-06 00:20:10,275 INFO L130 PetriNetUnfolder]: 34/150 cut-off events. [2022-12-06 00:20:10,276 INFO L131 PetriNetUnfolder]: For 287/296 co-relation queries the response was YES. [2022-12-06 00:20:10,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 150 events. 34/150 cut-off events. For 287/296 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 780 event pairs, 0 based on Foata normal form. 2/147 useless extension candidates. Maximal degree in co-relation 462. Up to 32 conditions per place. [2022-12-06 00:20:10,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 50 transitions, 403 flow [2022-12-06 00:20:10,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-06 00:20:10,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [287] $Ultimate##0-->L41-4: Formula: (and (let ((.cse0 (< 0 (mod v_~counter~0_97 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_41 1) (= v_~counter~0_97 v_~counter~0_95) .cse0) (and (= |v_thread2Thread1of1ForFork0_#t~post2_37| |v_thread2Thread1of1ForFork0_#t~post2_36|) (= (+ v_~counter~0_97 v_~C~0_55) v_~counter~0_95) (not .cse0) (= v_thread2Thread1of1ForFork0_~i~1_41 0)))) (= v_thread1Thread1of1ForFork1_~i~0_46 (+ v_thread1Thread1of1ForFork1_~i~0_47 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_47 4294967296) (mod v_~M~0_58 4294967296))) InVars {~counter~0=v_~counter~0_97, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_37|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_41, ~counter~0=v_~counter~0_95, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_25|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_46, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_36|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] and [277] L54-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (not (< (mod v_thread2Thread1of1ForFork0_~i~1_In_2 4294967296) (mod v_~M~0_In_2 4294967296))) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_In_2, ~M~0=v_~M~0_In_2} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_In_2, ~M~0=v_~M~0_In_2, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] [2022-12-06 00:20:10,408 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [287] $Ultimate##0-->L41-4: Formula: (and (let ((.cse0 (< 0 (mod v_~counter~0_97 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_41 1) (= v_~counter~0_97 v_~counter~0_95) .cse0) (and (= |v_thread2Thread1of1ForFork0_#t~post2_37| |v_thread2Thread1of1ForFork0_#t~post2_36|) (= (+ v_~counter~0_97 v_~C~0_55) v_~counter~0_95) (not .cse0) (= v_thread2Thread1of1ForFork0_~i~1_41 0)))) (= v_thread1Thread1of1ForFork1_~i~0_46 (+ v_thread1Thread1of1ForFork1_~i~0_47 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_47 4294967296) (mod v_~M~0_58 4294967296))) InVars {~counter~0=v_~counter~0_97, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_37|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_41, ~counter~0=v_~counter~0_95, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_25|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_46, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_36|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] and [248] L54-1-->L54-1: Formula: (and (< (mod v_thread2Thread1of1ForFork0_~i~1_16 4294967296) (mod v_~M~0_16 4294967296)) (let ((.cse0 (< 0 (mod v_~counter~0_22 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_16 v_thread2Thread1of1ForFork0_~i~1_15) (= |v_thread2Thread1of1ForFork0_#t~post2_8| |v_thread2Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~counter~0_22 v_~counter~0_21)) (and (= v_~counter~0_22 (+ v_~counter~0_21 v_~C~0_15)) (= v_thread2Thread1of1ForFork0_~i~1_15 (+ v_thread2Thread1of1ForFork0_~i~1_16 1)) .cse0)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_16, ~counter~0=v_~counter~0_22, ~M~0=v_~M~0_16, ~C~0=v_~C~0_15, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_15, ~counter~0=v_~counter~0_21, ~M~0=v_~M~0_16, ~C~0=v_~C~0_15, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 00:20:10,408 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:10,408 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:10,738 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [264] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_56 v_~C~0_33) v_~counter~0_55) (= v_thread1Thread1of1ForFork1_~i~0_31 (+ v_thread1Thread1of1ForFork1_~i~0_32 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_32 4294967296) (mod v_~M~0_30 4294967296))) InVars {~counter~0=v_~counter~0_56, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32} OutVars{~counter~0=v_~counter~0_55, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [248] L54-1-->L54-1: Formula: (and (< (mod v_thread2Thread1of1ForFork0_~i~1_16 4294967296) (mod v_~M~0_16 4294967296)) (let ((.cse0 (< 0 (mod v_~counter~0_22 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_16 v_thread2Thread1of1ForFork0_~i~1_15) (= |v_thread2Thread1of1ForFork0_#t~post2_8| |v_thread2Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~counter~0_22 v_~counter~0_21)) (and (= v_~counter~0_22 (+ v_~counter~0_21 v_~C~0_15)) (= v_thread2Thread1of1ForFork0_~i~1_15 (+ v_thread2Thread1of1ForFork0_~i~1_16 1)) .cse0)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_16, ~counter~0=v_~counter~0_22, ~M~0=v_~M~0_16, ~C~0=v_~C~0_15, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_15, ~counter~0=v_~counter~0_21, ~M~0=v_~M~0_16, ~C~0=v_~C~0_15, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 00:20:10,981 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L41-4-->L41-4: Formula: (let ((.cse0 (mod v_~M~0_68 4294967296))) (and (= v_thread1Thread1of1ForFork1_~i~0_71 (+ v_thread1Thread1of1ForFork1_~i~0_73 2)) (< (mod v_thread1Thread1of1ForFork1_~i~0_73 4294967296) .cse0) (= v_~counter~0_132 (+ v_~counter~0_134 (* 2 v_~C~0_65))) (< (mod (+ v_thread1Thread1of1ForFork1_~i~0_71 4294967295) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_134, ~M~0=v_~M~0_68, ~C~0=v_~C~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_73} OutVars{~counter~0=v_~counter~0_132, ~M~0=v_~M~0_68, ~C~0=v_~C~0_65, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_40|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [248] L54-1-->L54-1: Formula: (and (< (mod v_thread2Thread1of1ForFork0_~i~1_16 4294967296) (mod v_~M~0_16 4294967296)) (let ((.cse0 (< 0 (mod v_~counter~0_22 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_16 v_thread2Thread1of1ForFork0_~i~1_15) (= |v_thread2Thread1of1ForFork0_#t~post2_8| |v_thread2Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~counter~0_22 v_~counter~0_21)) (and (= v_~counter~0_22 (+ v_~counter~0_21 v_~C~0_15)) (= v_thread2Thread1of1ForFork0_~i~1_15 (+ v_thread2Thread1of1ForFork0_~i~1_16 1)) .cse0)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_16, ~counter~0=v_~counter~0_22, ~M~0=v_~M~0_16, ~C~0=v_~C~0_15, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_15, ~counter~0=v_~counter~0_21, ~M~0=v_~M~0_16, ~C~0=v_~C~0_15, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 00:20:11,156 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [264] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_56 v_~C~0_33) v_~counter~0_55) (= v_thread1Thread1of1ForFork1_~i~0_31 (+ v_thread1Thread1of1ForFork1_~i~0_32 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_32 4294967296) (mod v_~M~0_30 4294967296))) InVars {~counter~0=v_~counter~0_56, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32} OutVars{~counter~0=v_~counter~0_55, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [288] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (mod v_~M~0_60 4294967296))) (and (= |v_thread2Thread1of1ForFork0_#res.offset_19| 0) (= |v_thread2Thread1of1ForFork0_#res.base_19| 0) (< 0 (mod v_~counter~0_111 4294967296)) (= v_thread1Thread1of1ForFork1_~i~0_53 (+ v_thread1Thread1of1ForFork1_~i~0_54 1)) (= v_~counter~0_111 v_~counter~0_110) (= v_thread2Thread1of1ForFork0_~i~1_48 1) (< (mod v_thread1Thread1of1ForFork1_~i~0_54 4294967296) .cse0) (not (< (mod v_thread2Thread1of1ForFork0_~i~1_48 4294967296) .cse0)))) InVars {~counter~0=v_~counter~0_111, ~M~0=v_~M~0_60, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_54} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_19|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_48, ~counter~0=v_~counter~0_110, ~M~0=v_~M~0_60, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_53, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_46|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_~i~1, ~counter~0, thread2Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 00:20:11,167 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [264] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_56 v_~C~0_33) v_~counter~0_55) (= v_thread1Thread1of1ForFork1_~i~0_31 (+ v_thread1Thread1of1ForFork1_~i~0_32 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_32 4294967296) (mod v_~M~0_30 4294967296))) InVars {~counter~0=v_~counter~0_56, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32} OutVars{~counter~0=v_~counter~0_55, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [290] $Ultimate##0-->L54-1: Formula: (let ((.cse0 (mod v_~M~0_62 4294967296))) (and (< (mod v_thread1Thread1of1ForFork1_~i~0_58 4294967296) .cse0) (= v_thread1Thread1of1ForFork1_~i~0_57 (+ v_thread1Thread1of1ForFork1_~i~0_58 1)) (let ((.cse1 (< 0 (mod v_~counter~0_115 4294967296)))) (or (and (not .cse1) (= v_~counter~0_115 v_~counter~0_114) (= v_thread2Thread1of1ForFork0_~i~1_51 v_thread2Thread1of1ForFork0_~i~1_50) (= |v_thread2Thread1of1ForFork0_#t~post2_51| |v_thread2Thread1of1ForFork0_#t~post2_50|)) (and .cse1 (= (+ v_~counter~0_114 v_~C~0_59) v_~counter~0_115) (= (+ v_thread2Thread1of1ForFork0_~i~1_51 1) v_thread2Thread1of1ForFork0_~i~1_50)))) (let ((.cse2 (< 0 (mod v_~counter~0_116 4294967296)))) (or (and (= v_~counter~0_115 (+ v_~counter~0_116 v_~C~0_59)) (= v_thread2Thread1of1ForFork0_~i~1_51 0) (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post2_52| |v_thread2Thread1of1ForFork0_#t~post2_51|)) (and (= v_thread2Thread1of1ForFork0_~i~1_51 1) (= v_~counter~0_115 v_~counter~0_116) .cse2))) (< (mod v_thread2Thread1of1ForFork0_~i~1_51 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_116, ~M~0=v_~M~0_62, ~C~0=v_~C~0_59, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_58, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_52|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_50, ~counter~0=v_~counter~0_114, ~M~0=v_~M~0_62, ~C~0=v_~C~0_59, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_32|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_57, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_50|} AuxVars[v_thread2Thread1of1ForFork0_~i~1_51, v_~counter~0_115, |v_thread2Thread1of1ForFork0_#t~post2_51|] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 00:20:11,578 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [264] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_56 v_~C~0_33) v_~counter~0_55) (= v_thread1Thread1of1ForFork1_~i~0_31 (+ v_thread1Thread1of1ForFork1_~i~0_32 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_32 4294967296) (mod v_~M~0_30 4294967296))) InVars {~counter~0=v_~counter~0_56, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32} OutVars{~counter~0=v_~counter~0_55, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [291] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (mod v_~M~0_64 4294967296))) (and (< (mod (+ v_thread1Thread1of1ForFork1_~i~0_61 4294967295) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork1_~i~0_63 4294967296) .cse0) (= v_thread1Thread1of1ForFork1_~i~0_61 (+ v_thread1Thread1of1ForFork1_~i~0_63 2)) (let ((.cse1 (< 0 (mod v_~counter~0_122 4294967296)))) (or (and .cse1 (= v_thread2Thread1of1ForFork0_~i~1_54 1) (= v_~counter~0_120 (+ v_~counter~0_122 v_~C~0_61))) (and (not .cse1) (= (+ v_~counter~0_122 (* 2 v_~C~0_61)) v_~counter~0_120) (= |v_thread2Thread1of1ForFork0_#t~post2_57| |v_thread2Thread1of1ForFork0_#t~post2_56|) (= v_thread2Thread1of1ForFork0_~i~1_54 0)))))) InVars {~counter~0=v_~counter~0_122, ~M~0=v_~M~0_64, ~C~0=v_~C~0_61, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_63, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_57|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_54, ~counter~0=v_~counter~0_120, ~M~0=v_~M~0_64, ~C~0=v_~C~0_61, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_34|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_61, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_56|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 00:20:11,828 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:20:11,829 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1577 [2022-12-06 00:20:11,829 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 457 flow [2022-12-06 00:20:11,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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 00:20:11,829 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:11,829 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:11,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 00:20:12,030 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 00:20:12,030 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:20:12,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:12,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1124682173, now seen corresponding path program 1 times [2022-12-06 00:20:12,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:12,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606320418] [2022-12-06 00:20:12,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:12,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:12,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:12,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606320418] [2022-12-06 00:20:12,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606320418] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:20:12,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098375569] [2022-12-06 00:20:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:12,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:20:12,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:20:12,139 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 00:20:12,165 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 00:20:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:12,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:20:12,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:20:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:12,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:20:12,366 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 00:20:12,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098375569] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 00:20:12,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 00:20:12,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2022-12-06 00:20:12,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529473495] [2022-12-06 00:20:12,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:12,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:20:12,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:12,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:20:12,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:20:12,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 00:20:12,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 457 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 00:20:12,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:12,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 00:20:12,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:12,637 INFO L130 PetriNetUnfolder]: 428/851 cut-off events. [2022-12-06 00:20:12,638 INFO L131 PetriNetUnfolder]: For 3438/3438 co-relation queries the response was YES. [2022-12-06 00:20:12,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 851 events. 428/851 cut-off events. For 3438/3438 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4706 event pairs, 39 based on Foata normal form. 20/863 useless extension candidates. Maximal degree in co-relation 3744. Up to 469 conditions per place. [2022-12-06 00:20:12,644 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 59 selfloop transitions, 23 changer transitions 9/91 dead transitions. [2022-12-06 00:20:12,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 91 transitions, 915 flow [2022-12-06 00:20:12,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:20:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:20:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 00:20:12,646 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4148148148148148 [2022-12-06 00:20:12,646 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 457 flow. Second operand 5 states and 56 transitions. [2022-12-06 00:20:12,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 91 transitions, 915 flow [2022-12-06 00:20:12,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 91 transitions, 836 flow, removed 33 selfloop flow, removed 3 redundant places. [2022-12-06 00:20:12,662 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 601 flow [2022-12-06 00:20:12,662 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=601, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2022-12-06 00:20:12,665 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 40 predicate places. [2022-12-06 00:20:12,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:12,665 INFO L89 Accepts]: Start accepts. Operand has 60 places, 60 transitions, 601 flow [2022-12-06 00:20:12,667 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:12,667 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:12,667 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 60 transitions, 601 flow [2022-12-06 00:20:12,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 601 flow [2022-12-06 00:20:12,694 INFO L130 PetriNetUnfolder]: 63/267 cut-off events. [2022-12-06 00:20:12,695 INFO L131 PetriNetUnfolder]: For 708/728 co-relation queries the response was YES. [2022-12-06 00:20:12,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 267 events. 63/267 cut-off events. For 708/728 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1747 event pairs, 0 based on Foata normal form. 1/261 useless extension candidates. Maximal degree in co-relation 1000. Up to 73 conditions per place. [2022-12-06 00:20:12,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 60 transitions, 601 flow [2022-12-06 00:20:12,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 00:20:12,702 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] $Ultimate##0-->L54-1: Formula: (and (let ((.cse0 (< 0 (mod v_~counter~0_70 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_29 0) (= |v_thread2Thread1of1ForFork0_#t~post2_19| |v_thread2Thread1of1ForFork0_#t~post2_20|) (not .cse0) (= v_~counter~0_69 v_~counter~0_70)) (and (= v_thread2Thread1of1ForFork0_~i~1_29 1) .cse0 (= (+ v_~counter~0_69 v_~C~0_45) v_~counter~0_70)))) (< 0 (mod v_~M~0_48 4294967296))) InVars {~counter~0=v_~counter~0_70, ~M~0=v_~M~0_48, ~C~0=v_~C~0_45, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_20|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_29, ~counter~0=v_~counter~0_69, ~M~0=v_~M~0_48, ~C~0=v_~C~0_45, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread2Thread1of1ForFork0_#t~post2] and [264] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_56 v_~C~0_33) v_~counter~0_55) (= v_thread1Thread1of1ForFork1_~i~0_31 (+ v_thread1Thread1of1ForFork1_~i~0_32 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_32 4294967296) (mod v_~M~0_30 4294967296))) InVars {~counter~0=v_~counter~0_56, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32} OutVars{~counter~0=v_~counter~0_55, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 00:20:12,844 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [264] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_56 v_~C~0_33) v_~counter~0_55) (= v_thread1Thread1of1ForFork1_~i~0_31 (+ v_thread1Thread1of1ForFork1_~i~0_32 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_32 4294967296) (mod v_~M~0_30 4294967296))) InVars {~counter~0=v_~counter~0_56, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32} OutVars{~counter~0=v_~counter~0_55, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [248] L54-1-->L54-1: Formula: (and (< (mod v_thread2Thread1of1ForFork0_~i~1_16 4294967296) (mod v_~M~0_16 4294967296)) (let ((.cse0 (< 0 (mod v_~counter~0_22 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_16 v_thread2Thread1of1ForFork0_~i~1_15) (= |v_thread2Thread1of1ForFork0_#t~post2_8| |v_thread2Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~counter~0_22 v_~counter~0_21)) (and (= v_~counter~0_22 (+ v_~counter~0_21 v_~C~0_15)) (= v_thread2Thread1of1ForFork0_~i~1_15 (+ v_thread2Thread1of1ForFork0_~i~1_16 1)) .cse0)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_16, ~counter~0=v_~counter~0_22, ~M~0=v_~M~0_16, ~C~0=v_~C~0_15, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_15, ~counter~0=v_~counter~0_21, ~M~0=v_~M~0_16, ~C~0=v_~C~0_15, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 00:20:12,952 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [192] $Ultimate##0-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] and [281] $Ultimate##0-->L54-1: Formula: (and (let ((.cse0 (< 0 (mod v_~counter~0_70 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_29 0) (= |v_thread2Thread1of1ForFork0_#t~post2_19| |v_thread2Thread1of1ForFork0_#t~post2_20|) (not .cse0) (= v_~counter~0_69 v_~counter~0_70)) (and (= v_thread2Thread1of1ForFork0_~i~1_29 1) .cse0 (= (+ v_~counter~0_69 v_~C~0_45) v_~counter~0_70)))) (< 0 (mod v_~M~0_48 4294967296))) InVars {~counter~0=v_~counter~0_70, ~M~0=v_~M~0_48, ~C~0=v_~C~0_45, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_20|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_29, ~counter~0=v_~counter~0_69, ~M~0=v_~M~0_48, ~C~0=v_~C~0_45, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 00:20:13,036 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:20:13,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 372 [2022-12-06 00:20:13,037 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 615 flow [2022-12-06 00:20:13,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 00:20:13,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:13,037 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:13,045 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 00:20:13,238 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 00:20:13,238 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:20:13,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:13,238 INFO L85 PathProgramCache]: Analyzing trace with hash -605884865, now seen corresponding path program 1 times [2022-12-06 00:20:13,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:13,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042140022] [2022-12-06 00:20:13,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:13,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:13,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042140022] [2022-12-06 00:20:13,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042140022] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:20:13,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641705514] [2022-12-06 00:20:13,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:13,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:20:13,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:20:13,494 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 00:20:13,496 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 00:20:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:13,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 00:20:13,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:20:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:13,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:20:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:14,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641705514] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:20:14,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:20:14,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 00:20:14,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570908990] [2022-12-06 00:20:14,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:20:14,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:20:14,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:14,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:20:14,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:20:14,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 00:20:14,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 59 transitions, 615 flow. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 00:20:14,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:14,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 00:20:14,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:14,487 INFO L130 PetriNetUnfolder]: 391/782 cut-off events. [2022-12-06 00:20:14,488 INFO L131 PetriNetUnfolder]: For 3584/3584 co-relation queries the response was YES. [2022-12-06 00:20:14,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 782 events. 391/782 cut-off events. For 3584/3584 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4209 event pairs, 96 based on Foata normal form. 6/788 useless extension candidates. Maximal degree in co-relation 3792. Up to 560 conditions per place. [2022-12-06 00:20:14,493 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 57 selfloop transitions, 23 changer transitions 15/95 dead transitions. [2022-12-06 00:20:14,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 1027 flow [2022-12-06 00:20:14,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:20:14,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:20:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-12-06 00:20:14,494 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-06 00:20:14,494 INFO L175 Difference]: Start difference. First operand has 57 places, 59 transitions, 615 flow. Second operand 8 states and 63 transitions. [2022-12-06 00:20:14,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 1027 flow [2022-12-06 00:20:14,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 95 transitions, 996 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-06 00:20:14,507 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 639 flow [2022-12-06 00:20:14,507 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=639, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2022-12-06 00:20:14,508 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 44 predicate places. [2022-12-06 00:20:14,508 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:14,508 INFO L89 Accepts]: Start accepts. Operand has 64 places, 59 transitions, 639 flow [2022-12-06 00:20:14,511 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:14,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:14,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 59 transitions, 639 flow [2022-12-06 00:20:14,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 59 transitions, 639 flow [2022-12-06 00:20:14,539 INFO L130 PetriNetUnfolder]: 60/265 cut-off events. [2022-12-06 00:20:14,539 INFO L131 PetriNetUnfolder]: For 747/762 co-relation queries the response was YES. [2022-12-06 00:20:14,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 265 events. 60/265 cut-off events. For 747/762 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1753 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 1001. Up to 65 conditions per place. [2022-12-06 00:20:14,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 59 transitions, 639 flow [2022-12-06 00:20:14,542 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-06 00:20:14,567 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [264] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_56 v_~C~0_33) v_~counter~0_55) (= v_thread1Thread1of1ForFork1_~i~0_31 (+ v_thread1Thread1of1ForFork1_~i~0_32 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_32 4294967296) (mod v_~M~0_30 4294967296))) InVars {~counter~0=v_~counter~0_56, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32} OutVars{~counter~0=v_~counter~0_55, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [287] $Ultimate##0-->L41-4: Formula: (and (let ((.cse0 (< 0 (mod v_~counter~0_97 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_41 1) (= v_~counter~0_97 v_~counter~0_95) .cse0) (and (= |v_thread2Thread1of1ForFork0_#t~post2_37| |v_thread2Thread1of1ForFork0_#t~post2_36|) (= (+ v_~counter~0_97 v_~C~0_55) v_~counter~0_95) (not .cse0) (= v_thread2Thread1of1ForFork0_~i~1_41 0)))) (= v_thread1Thread1of1ForFork1_~i~0_46 (+ v_thread1Thread1of1ForFork1_~i~0_47 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_47 4294967296) (mod v_~M~0_58 4294967296))) InVars {~counter~0=v_~counter~0_97, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_37|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_41, ~counter~0=v_~counter~0_95, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_25|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_46, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_36|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 00:20:14,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [301] L41-4-->L54-1: Formula: (let ((.cse0 (mod v_~M~0_84 4294967296))) (and (< (mod v_thread2Thread1of1ForFork0_~i~1_76 4294967296) .cse0) (= v_thread1Thread1of1ForFork1_~i~0_117 (+ v_thread1Thread1of1ForFork1_~i~0_118 1)) (let ((.cse2 (+ v_~counter~0_188 v_~C~0_81))) (let ((.cse1 (< 0 (mod .cse2 4294967296)))) (or (and (= (+ v_thread2Thread1of1ForFork0_~i~1_76 1) v_thread2Thread1of1ForFork0_~i~1_75) .cse1 (= v_~counter~0_188 v_~counter~0_186)) (and (= |v_thread2Thread1of1ForFork0_#t~post2_87| |v_thread2Thread1of1ForFork0_#t~post2_86|) (= v_~counter~0_186 .cse2) (not .cse1) (= v_thread2Thread1of1ForFork0_~i~1_76 v_thread2Thread1of1ForFork0_~i~1_75))))) (< (mod v_thread1Thread1of1ForFork1_~i~0_118 4294967296) .cse0))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_76, ~counter~0=v_~counter~0_188, ~M~0=v_~M~0_84, ~C~0=v_~C~0_81, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_118, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_87|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_75, ~counter~0=v_~counter~0_186, ~M~0=v_~M~0_84, ~C~0=v_~C~0_81, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_70|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_117, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_86|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] and [287] $Ultimate##0-->L41-4: Formula: (and (let ((.cse0 (< 0 (mod v_~counter~0_97 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_41 1) (= v_~counter~0_97 v_~counter~0_95) .cse0) (and (= |v_thread2Thread1of1ForFork0_#t~post2_37| |v_thread2Thread1of1ForFork0_#t~post2_36|) (= (+ v_~counter~0_97 v_~C~0_55) v_~counter~0_95) (not .cse0) (= v_thread2Thread1of1ForFork0_~i~1_41 0)))) (= v_thread1Thread1of1ForFork1_~i~0_46 (+ v_thread1Thread1of1ForFork1_~i~0_47 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_47 4294967296) (mod v_~M~0_58 4294967296))) InVars {~counter~0=v_~counter~0_97, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_37|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_41, ~counter~0=v_~counter~0_95, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_25|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_46, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_36|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 00:20:14,697 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:14,697 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:14,994 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [264] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_56 v_~C~0_33) v_~counter~0_55) (= v_thread1Thread1of1ForFork1_~i~0_31 (+ v_thread1Thread1of1ForFork1_~i~0_32 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_32 4294967296) (mod v_~M~0_30 4294967296))) InVars {~counter~0=v_~counter~0_56, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32} OutVars{~counter~0=v_~counter~0_55, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [287] $Ultimate##0-->L41-4: Formula: (and (let ((.cse0 (< 0 (mod v_~counter~0_97 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_41 1) (= v_~counter~0_97 v_~counter~0_95) .cse0) (and (= |v_thread2Thread1of1ForFork0_#t~post2_37| |v_thread2Thread1of1ForFork0_#t~post2_36|) (= (+ v_~counter~0_97 v_~C~0_55) v_~counter~0_95) (not .cse0) (= v_thread2Thread1of1ForFork0_~i~1_41 0)))) (= v_thread1Thread1of1ForFork1_~i~0_46 (+ v_thread1Thread1of1ForFork1_~i~0_47 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_47 4294967296) (mod v_~M~0_58 4294967296))) InVars {~counter~0=v_~counter~0_97, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_37|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_41, ~counter~0=v_~counter~0_95, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_25|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_46, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_36|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 00:20:15,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] L41-4-->L54-1: Formula: (let ((.cse0 (mod v_~M~0_72 4294967296))) (and (< (mod (+ v_thread1Thread1of1ForFork1_~i~0_83 4294967295) 4294967296) .cse0) (let ((.cse2 (+ v_~counter~0_146 (* 2 v_~C~0_69)))) (let ((.cse1 (< 0 (mod .cse2 4294967296)))) (or (and (= (+ v_thread2Thread1of1ForFork0_~i~1_61 1) v_thread2Thread1of1ForFork0_~i~1_60) .cse1 (= v_~counter~0_144 (+ v_~counter~0_146 v_~C~0_69))) (and (= |v_thread2Thread1of1ForFork0_#t~post2_65| |v_thread2Thread1of1ForFork0_#t~post2_64|) (= v_~counter~0_144 .cse2) (= v_thread2Thread1of1ForFork0_~i~1_61 v_thread2Thread1of1ForFork0_~i~1_60) (not .cse1))))) (< (mod v_thread2Thread1of1ForFork0_~i~1_61 4294967296) .cse0) (= v_thread1Thread1of1ForFork1_~i~0_83 (+ v_thread1Thread1of1ForFork1_~i~0_84 2)) (< (mod v_thread1Thread1of1ForFork1_~i~0_84 4294967296) .cse0))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, ~counter~0=v_~counter~0_146, ~M~0=v_~M~0_72, ~C~0=v_~C~0_69, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_84, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_65|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_60, ~counter~0=v_~counter~0_144, ~M~0=v_~M~0_72, ~C~0=v_~C~0_69, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_48|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_83, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_64|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] and [287] $Ultimate##0-->L41-4: Formula: (and (let ((.cse0 (< 0 (mod v_~counter~0_97 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_41 1) (= v_~counter~0_97 v_~counter~0_95) .cse0) (and (= |v_thread2Thread1of1ForFork0_#t~post2_37| |v_thread2Thread1of1ForFork0_#t~post2_36|) (= (+ v_~counter~0_97 v_~C~0_55) v_~counter~0_95) (not .cse0) (= v_thread2Thread1of1ForFork0_~i~1_41 0)))) (= v_thread1Thread1of1ForFork1_~i~0_46 (+ v_thread1Thread1of1ForFork1_~i~0_47 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_47 4294967296) (mod v_~M~0_58 4294967296))) InVars {~counter~0=v_~counter~0_97, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_37|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_41, ~counter~0=v_~counter~0_95, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_25|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_46, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_36|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 00:20:15,123 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:15,123 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:15,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [264] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_56 v_~C~0_33) v_~counter~0_55) (= v_thread1Thread1of1ForFork1_~i~0_31 (+ v_thread1Thread1of1ForFork1_~i~0_32 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_32 4294967296) (mod v_~M~0_30 4294967296))) InVars {~counter~0=v_~counter~0_56, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32} OutVars{~counter~0=v_~counter~0_55, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [287] $Ultimate##0-->L41-4: Formula: (and (let ((.cse0 (< 0 (mod v_~counter~0_97 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_41 1) (= v_~counter~0_97 v_~counter~0_95) .cse0) (and (= |v_thread2Thread1of1ForFork0_#t~post2_37| |v_thread2Thread1of1ForFork0_#t~post2_36|) (= (+ v_~counter~0_97 v_~C~0_55) v_~counter~0_95) (not .cse0) (= v_thread2Thread1of1ForFork0_~i~1_41 0)))) (= v_thread1Thread1of1ForFork1_~i~0_46 (+ v_thread1Thread1of1ForFork1_~i~0_47 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_47 4294967296) (mod v_~M~0_58 4294967296))) InVars {~counter~0=v_~counter~0_97, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_37|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_41, ~counter~0=v_~counter~0_95, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_25|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_46, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_36|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 00:20:15,662 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [294] L41-4-->L41-4: Formula: (let ((.cse0 (mod v_~M~0_70 4294967296))) (and (= v_thread1Thread1of1ForFork1_~i~0_77 (+ v_thread1Thread1of1ForFork1_~i~0_79 3)) (< (mod v_thread1Thread1of1ForFork1_~i~0_79 4294967296) .cse0) (= (+ v_~counter~0_140 (* 3 v_~C~0_67)) v_~counter~0_138) (< (mod (+ v_thread1Thread1of1ForFork1_~i~0_79 1) 4294967296) .cse0) (< (mod (+ v_thread1Thread1of1ForFork1_~i~0_79 2) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_140, ~M~0=v_~M~0_70, ~C~0=v_~C~0_67, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_79} OutVars{~counter~0=v_~counter~0_138, ~M~0=v_~M~0_70, ~C~0=v_~C~0_67, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_44|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_77} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [287] $Ultimate##0-->L41-4: Formula: (and (let ((.cse0 (< 0 (mod v_~counter~0_97 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_41 1) (= v_~counter~0_97 v_~counter~0_95) .cse0) (and (= |v_thread2Thread1of1ForFork0_#t~post2_37| |v_thread2Thread1of1ForFork0_#t~post2_36|) (= (+ v_~counter~0_97 v_~C~0_55) v_~counter~0_95) (not .cse0) (= v_thread2Thread1of1ForFork0_~i~1_41 0)))) (= v_thread1Thread1of1ForFork1_~i~0_46 (+ v_thread1Thread1of1ForFork1_~i~0_47 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_47 4294967296) (mod v_~M~0_58 4294967296))) InVars {~counter~0=v_~counter~0_97, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_37|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_41, ~counter~0=v_~counter~0_95, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_25|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_46, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_36|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 00:20:16,164 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [264] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_56 v_~C~0_33) v_~counter~0_55) (= v_thread1Thread1of1ForFork1_~i~0_31 (+ v_thread1Thread1of1ForFork1_~i~0_32 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_32 4294967296) (mod v_~M~0_30 4294967296))) InVars {~counter~0=v_~counter~0_56, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32} OutVars{~counter~0=v_~counter~0_55, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [287] $Ultimate##0-->L41-4: Formula: (and (let ((.cse0 (< 0 (mod v_~counter~0_97 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_41 1) (= v_~counter~0_97 v_~counter~0_95) .cse0) (and (= |v_thread2Thread1of1ForFork0_#t~post2_37| |v_thread2Thread1of1ForFork0_#t~post2_36|) (= (+ v_~counter~0_97 v_~C~0_55) v_~counter~0_95) (not .cse0) (= v_thread2Thread1of1ForFork0_~i~1_41 0)))) (= v_thread1Thread1of1ForFork1_~i~0_46 (+ v_thread1Thread1of1ForFork1_~i~0_47 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_47 4294967296) (mod v_~M~0_58 4294967296))) InVars {~counter~0=v_~counter~0_97, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_37|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_41, ~counter~0=v_~counter~0_95, ~M~0=v_~M~0_58, ~C~0=v_~C~0_55, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_25|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_46, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_36|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 00:20:16,442 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [297] L41-4-->L54-1: Formula: (let ((.cse0 (mod v_~M~0_76 4294967296))) (and (= v_thread1Thread1of1ForFork1_~i~0_93 (+ v_thread1Thread1of1ForFork1_~i~0_95 2)) (< (mod (+ v_thread1Thread1of1ForFork1_~i~0_95 1) 4294967296) .cse0) (let ((.cse1 (+ v_~counter~0_159 v_~C~0_73))) (let ((.cse2 (< 0 (mod .cse1 4294967296)))) (or (and (= v_~counter~0_158 .cse1) .cse2 (= v_thread2Thread1of1ForFork0_~i~1_67 1)) (and (= v_thread2Thread1of1ForFork0_~i~1_67 0) (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post2_72| |v_thread2Thread1of1ForFork0_#t~post2_71|) (= v_~counter~0_158 (+ v_~counter~0_159 (* 2 v_~C~0_73))))))) (< (mod v_thread1Thread1of1ForFork1_~i~0_95 4294967296) .cse0) (let ((.cse3 (< 0 (mod v_~counter~0_158 4294967296)))) (or (and (= (+ v_thread2Thread1of1ForFork0_~i~1_67 1) v_thread2Thread1of1ForFork0_~i~1_66) .cse3 (= v_~counter~0_158 (+ v_~counter~0_156 v_~C~0_73))) (and (= v_thread2Thread1of1ForFork0_~i~1_67 v_thread2Thread1of1ForFork0_~i~1_66) (= |v_thread2Thread1of1ForFork0_#t~post2_72| |v_thread2Thread1of1ForFork0_#t~post2_70|) (= v_~counter~0_158 v_~counter~0_156) (not .cse3)))))) InVars {~counter~0=v_~counter~0_159, ~M~0=v_~M~0_76, ~C~0=v_~C~0_73, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_95, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_71|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_66, ~counter~0=v_~counter~0_156, ~M~0=v_~M~0_76, ~C~0=v_~C~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_54|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_93, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_70|} AuxVars[v_~counter~0_158, v_thread2Thread1of1ForFork0_~i~1_67, |v_thread2Thread1of1ForFork0_#t~post2_72|] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] and [264] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_56 v_~C~0_33) v_~counter~0_55) (= v_thread1Thread1of1ForFork1_~i~0_31 (+ v_thread1Thread1of1ForFork1_~i~0_32 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_32 4294967296) (mod v_~M~0_30 4294967296))) InVars {~counter~0=v_~counter~0_56, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32} OutVars{~counter~0=v_~counter~0_55, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 00:20:17,011 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:20:17,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2504 [2022-12-06 00:20:17,012 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 758 flow [2022-12-06 00:20:17,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 00:20:17,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:17,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:17,032 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 00:20:17,212 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 00:20:17,214 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:20:17,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:17,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1533971526, now seen corresponding path program 1 times [2022-12-06 00:20:17,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:17,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029037684] [2022-12-06 00:20:17,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:17,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:17,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:17,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029037684] [2022-12-06 00:20:17,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029037684] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:20:17,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299720708] [2022-12-06 00:20:17,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:17,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:20:17,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:20:17,603 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 00:20:17,635 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 00:20:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:17,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 00:20:17,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:20:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:17,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:20:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:18,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299720708] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:20:18,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:20:18,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 00:20:18,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042941553] [2022-12-06 00:20:18,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:20:18,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 00:20:18,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:18,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 00:20:18,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-12-06 00:20:18,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:20:18,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 758 flow. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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 00:20:18,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:18,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:20:18,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:19,821 INFO L130 PetriNetUnfolder]: 452/917 cut-off events. [2022-12-06 00:20:19,822 INFO L131 PetriNetUnfolder]: For 4694/4694 co-relation queries the response was YES. [2022-12-06 00:20:19,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 917 events. 452/917 cut-off events. For 4694/4694 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5230 event pairs, 96 based on Foata normal form. 28/945 useless extension candidates. Maximal degree in co-relation 4456. Up to 746 conditions per place. [2022-12-06 00:20:19,828 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 63 selfloop transitions, 27 changer transitions 25/115 dead transitions. [2022-12-06 00:20:19,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 115 transitions, 1238 flow [2022-12-06 00:20:19,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:20:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:20:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 81 transitions. [2022-12-06 00:20:19,830 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19285714285714287 [2022-12-06 00:20:19,830 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 758 flow. Second operand 12 states and 81 transitions. [2022-12-06 00:20:19,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 115 transitions, 1238 flow [2022-12-06 00:20:19,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 115 transitions, 1166 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-06 00:20:19,878 INFO L231 Difference]: Finished difference. Result has 77 places, 67 transitions, 776 flow [2022-12-06 00:20:19,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=776, PETRI_PLACES=77, PETRI_TRANSITIONS=67} [2022-12-06 00:20:19,880 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 57 predicate places. [2022-12-06 00:20:19,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:19,880 INFO L89 Accepts]: Start accepts. Operand has 77 places, 67 transitions, 776 flow [2022-12-06 00:20:19,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:19,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:19,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 67 transitions, 776 flow [2022-12-06 00:20:19,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 67 transitions, 776 flow [2022-12-06 00:20:19,913 INFO L130 PetriNetUnfolder]: 81/315 cut-off events. [2022-12-06 00:20:19,913 INFO L131 PetriNetUnfolder]: For 2228/2230 co-relation queries the response was YES. [2022-12-06 00:20:19,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1491 conditions, 315 events. 81/315 cut-off events. For 2228/2230 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2113 event pairs, 13 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 1462. Up to 77 conditions per place. [2022-12-06 00:20:19,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 67 transitions, 776 flow [2022-12-06 00:20:19,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 00:20:19,928 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:19,929 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:20,480 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] L41-4-->L54-1: Formula: (let ((.cse0 (mod v_~M~0_72 4294967296))) (and (< (mod (+ v_thread1Thread1of1ForFork1_~i~0_83 4294967295) 4294967296) .cse0) (let ((.cse2 (+ v_~counter~0_146 (* 2 v_~C~0_69)))) (let ((.cse1 (< 0 (mod .cse2 4294967296)))) (or (and (= (+ v_thread2Thread1of1ForFork0_~i~1_61 1) v_thread2Thread1of1ForFork0_~i~1_60) .cse1 (= v_~counter~0_144 (+ v_~counter~0_146 v_~C~0_69))) (and (= |v_thread2Thread1of1ForFork0_#t~post2_65| |v_thread2Thread1of1ForFork0_#t~post2_64|) (= v_~counter~0_144 .cse2) (= v_thread2Thread1of1ForFork0_~i~1_61 v_thread2Thread1of1ForFork0_~i~1_60) (not .cse1))))) (< (mod v_thread2Thread1of1ForFork0_~i~1_61 4294967296) .cse0) (= v_thread1Thread1of1ForFork1_~i~0_83 (+ v_thread1Thread1of1ForFork1_~i~0_84 2)) (< (mod v_thread1Thread1of1ForFork1_~i~0_84 4294967296) .cse0))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, ~counter~0=v_~counter~0_146, ~M~0=v_~M~0_72, ~C~0=v_~C~0_69, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_84, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_65|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_60, ~counter~0=v_~counter~0_144, ~M~0=v_~M~0_72, ~C~0=v_~C~0_69, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_48|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_83, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_64|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] and [264] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_56 v_~C~0_33) v_~counter~0_55) (= v_thread1Thread1of1ForFork1_~i~0_31 (+ v_thread1Thread1of1ForFork1_~i~0_32 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_32 4294967296) (mod v_~M~0_30 4294967296))) InVars {~counter~0=v_~counter~0_56, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32} OutVars{~counter~0=v_~counter~0_55, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 00:20:20,817 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [314] L41-4-->L54-1: Formula: (let ((.cse0 (mod v_~M~0_120 4294967296))) (and (< (mod (+ 4294967295 v_thread1Thread1of1ForFork1_~i~0_204) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork1_~i~0_205 4294967296) .cse0) (< (mod v_thread2Thread1of1ForFork0_~i~1_143 4294967296) .cse0) (let ((.cse1 (< 0 (mod v_~counter~0_290 4294967296)))) (or (and .cse1 (= v_thread2Thread1of1ForFork0_~i~1_142 (+ v_thread2Thread1of1ForFork0_~i~1_143 1)) (= v_~counter~0_290 (+ v_~counter~0_289 v_~C~0_114))) (and (not .cse1) (= |v_thread2Thread1of1ForFork0_#t~post2_167| |v_thread2Thread1of1ForFork0_#t~post2_166|) (= v_thread2Thread1of1ForFork0_~i~1_143 v_thread2Thread1of1ForFork0_~i~1_142) (= v_~counter~0_289 v_~counter~0_290)))) (= (+ 2 v_thread1Thread1of1ForFork1_~i~0_205) v_thread1Thread1of1ForFork1_~i~0_204) (< (mod v_thread2Thread1of1ForFork0_~i~1_144 4294967296) .cse0) (let ((.cse3 (+ v_~counter~0_291 (* 2 v_~C~0_114)))) (let ((.cse2 (< 0 (mod .cse3 4294967296)))) (or (and (= v_thread2Thread1of1ForFork0_~i~1_144 v_thread2Thread1of1ForFork0_~i~1_143) (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post2_168| |v_thread2Thread1of1ForFork0_#t~post2_167|) (= v_~counter~0_290 .cse3)) (and (= v_thread2Thread1of1ForFork0_~i~1_143 (+ v_thread2Thread1of1ForFork0_~i~1_144 1)) (= v_~counter~0_290 (+ v_~counter~0_291 v_~C~0_114)) .cse2)))))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_144, ~counter~0=v_~counter~0_291, ~M~0=v_~M~0_120, ~C~0=v_~C~0_114, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_205, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_168|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_142, ~counter~0=v_~counter~0_289, ~M~0=v_~M~0_120, ~C~0=v_~C~0_114, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_120|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_204, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_166|} AuxVars[v_thread2Thread1of1ForFork0_~i~1_143, v_~counter~0_290, |v_thread2Thread1of1ForFork0_#t~post2_167|] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] and [264] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_56 v_~C~0_33) v_~counter~0_55) (= v_thread1Thread1of1ForFork1_~i~0_31 (+ v_thread1Thread1of1ForFork1_~i~0_32 1)) (< (mod v_thread1Thread1of1ForFork1_~i~0_32 4294967296) (mod v_~M~0_30 4294967296))) InVars {~counter~0=v_~counter~0_56, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32} OutVars{~counter~0=v_~counter~0_55, ~M~0=v_~M~0_30, ~C~0=v_~C~0_33, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 00:20:21,763 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:21,764 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:21,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 00:20:21,965 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 00:20:21,965 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_~counter~0_293 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 00:20:21,968 INFO L158 Benchmark]: Toolchain (without parser) took 22723.33ms. Allocated memory was 174.1MB in the beginning and 306.2MB in the end (delta: 132.1MB). Free memory was 150.6MB in the beginning and 193.1MB in the end (delta: -42.5MB). Peak memory consumption was 90.7MB. Max. memory is 8.0GB. [2022-12-06 00:20:21,969 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 174.1MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:20:21,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.70ms. Allocated memory is still 174.1MB. Free memory was 150.6MB in the beginning and 139.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 00:20:21,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.78ms. Allocated memory is still 174.1MB. Free memory was 139.6MB in the beginning and 138.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:20:21,969 INFO L158 Benchmark]: Boogie Preprocessor took 28.26ms. Allocated memory is still 174.1MB. Free memory was 138.0MB in the beginning and 136.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:20:21,969 INFO L158 Benchmark]: RCFGBuilder took 425.95ms. Allocated memory is still 174.1MB. Free memory was 136.5MB in the beginning and 122.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 00:20:21,970 INFO L158 Benchmark]: TraceAbstraction took 22022.93ms. Allocated memory was 174.1MB in the beginning and 306.2MB in the end (delta: 132.1MB). Free memory was 122.3MB in the beginning and 193.1MB in the end (delta: -70.8MB). Peak memory consumption was 62.4MB. Max. memory is 8.0GB. [2022-12-06 00:20:21,970 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 174.1MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.70ms. Allocated memory is still 174.1MB. Free memory was 150.6MB in the beginning and 139.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.78ms. Allocated memory is still 174.1MB. Free memory was 139.6MB in the beginning and 138.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.26ms. Allocated memory is still 174.1MB. Free memory was 138.0MB in the beginning and 136.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 425.95ms. Allocated memory is still 174.1MB. Free memory was 136.5MB in the beginning and 122.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 22022.93ms. Allocated memory was 174.1MB in the beginning and 306.2MB in the end (delta: 132.1MB). Free memory was 122.3MB in the beginning and 193.1MB in the end (delta: -70.8MB). Peak memory consumption was 62.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 68 PlacesBefore, 20 PlacesAfterwards, 67 TransitionsBefore, 15 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 32 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 52 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 191, independent: 189, independent conditional: 189, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 191, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 191, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 191, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 191, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 191, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 191, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 191, unknown conditional: 0, unknown unconditional: 191] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 291, Positive conditional cache size: 0, Positive unconditional cache size: 291, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 19 PlacesBefore, 19 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 66 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.4s, 24 PlacesBefore, 23 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 2, independent unconditional: 12, 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: 14, independent: 14, independent conditional: 2, independent unconditional: 12, 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: 14, independent: 14, independent conditional: 2, independent unconditional: 12, 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: 7, independent: 7, independent conditional: 1, independent unconditional: 6, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 14, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 20 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 66 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): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, 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.6s, 35 PlacesBefore, 34 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 14, independent unconditional: 4, 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: 18, independent: 18, independent conditional: 14, independent unconditional: 4, 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: 9, independent: 9, independent conditional: 6, independent unconditional: 3, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 18, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 6, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 7, Positive unconditional cache size: 11, 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: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 126 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): 18, Positive cache size: 18, Positive conditional cache size: 7, Positive unconditional cache size: 11, 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, 31 TransitionsBefore, 31 TransitionsAfterwards, 126 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): 18, Positive cache size: 18, Positive conditional cache size: 7, Positive unconditional cache size: 11, 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.6s, 56 PlacesBefore, 55 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 31, 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: 31, independent: 31, independent conditional: 31, 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: 31, independent: 31, independent conditional: 31, 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: 31, independent: 31, independent conditional: 31, 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: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 31, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 51, Positive conditional cache size: 37, Positive unconditional cache size: 14, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 58 PlacesBefore, 57 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 6, independent unconditional: 3, 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: 9, independent: 9, independent conditional: 6, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 9, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 54, Positive conditional cache size: 40, Positive unconditional cache size: 14, 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: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 64 PlacesBefore, 65 PlacesAfterwards, 59 TransitionsBefore, 62 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 73, Positive conditional cache size: 59, Positive unconditional cache size: 14, Negative cache size: 3, Negative conditional cache size: 3, 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: 2 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_~counter~0_293 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_~counter~0_293 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 00:20:21,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...