/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-RepeatedSemanticLbeWithPredicates.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 05:36:37,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:36:37,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:36:37,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:36:37,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:36:37,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:36:37,408 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:36:37,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:36:37,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:36:37,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:36:37,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:36:37,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:36:37,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:36:37,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:36:37,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:36:37,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:36:37,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:36:37,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:36:37,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:36:37,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:36:37,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:36:37,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:36:37,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:36:37,449 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:36:37,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:36:37,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:36:37,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:36:37,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:36:37,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:36:37,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:36:37,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:36:37,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:36:37,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:36:37,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:36:37,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:36:37,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:36:37,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:36:37,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:36:37,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:36:37,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:36:37,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:36:37,463 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:36:37,487 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:36:37,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:36:37,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:36:37,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:36:37,488 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:36:37,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:36:37,489 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:36:37,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:36:37,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:36:37,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:36:37,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:36:37,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:36:37,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:36:37,490 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:36:37,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:36:37,491 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:36:37,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:36:37,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:36:37,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:36:37,491 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:36:37,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:36:37,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:36:37,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:36:37,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:36:37,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:36:37,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:36:37,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:36:37,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:36:37,492 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 05:36:37,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:36:37,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:36:37,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:36:37,807 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:36:37,807 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:36:37,808 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 05:36:38,845 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:36:38,995 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:36:38,996 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2022-12-06 05:36:39,006 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0359eb22/980e6b15b25c4c2cbbe4255fd92f7de5/FLAGd9a96d979 [2022-12-06 05:36:39,015 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0359eb22/980e6b15b25c4c2cbbe4255fd92f7de5 [2022-12-06 05:36:39,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:36:39,019 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:36:39,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:36:39,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:36:39,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:36:39,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:36:39" (1/1) ... [2022-12-06 05:36:39,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cf05163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:39, skipping insertion in model container [2022-12-06 05:36:39,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:36:39" (1/1) ... [2022-12-06 05:36:39,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:36:39,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:36:39,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:36:39,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:36:39,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:36:39,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:36:39,148 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 05:36:39,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:36:39,159 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:36:39,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:36:39,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:36:39,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:36:39,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:36:39,183 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 05:36:39,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:36:39,198 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:36:39,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:39 WrapperNode [2022-12-06 05:36:39,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:36:39,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:36:39,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:36:39,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:36:39,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:39" (1/1) ... [2022-12-06 05:36:39,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:39" (1/1) ... [2022-12-06 05:36:39,226 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2022-12-06 05:36:39,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:36:39,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:36:39,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:36:39,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:36:39,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:39" (1/1) ... [2022-12-06 05:36:39,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:39" (1/1) ... [2022-12-06 05:36:39,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:39" (1/1) ... [2022-12-06 05:36:39,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:39" (1/1) ... [2022-12-06 05:36:39,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:39" (1/1) ... [2022-12-06 05:36:39,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:39" (1/1) ... [2022-12-06 05:36:39,254 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:39" (1/1) ... [2022-12-06 05:36:39,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:39" (1/1) ... [2022-12-06 05:36:39,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:36:39,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:36:39,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:36:39,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:36:39,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:39" (1/1) ... [2022-12-06 05:36:39,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:36:39,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:36:39,297 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 05:36:39,346 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 05:36:39,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:36:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:36:39,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:36:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:36:39,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:36:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:36:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:36:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:36:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:36:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:36:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:36:39,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:36:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:36:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:36:39,364 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 05:36:39,446 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:36:39,447 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:36:39,564 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:36:39,589 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:36:39,589 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 05:36:39,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:36:39 BoogieIcfgContainer [2022-12-06 05:36:39,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:36:39,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:36:39,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:36:39,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:36:39,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:36:39" (1/3) ... [2022-12-06 05:36:39,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ccb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:36:39, skipping insertion in model container [2022-12-06 05:36:39,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:39" (2/3) ... [2022-12-06 05:36:39,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ccb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:36:39, skipping insertion in model container [2022-12-06 05:36:39,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:36:39" (3/3) ... [2022-12-06 05:36:39,596 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-nonblocking-counter-alt2.wvr.c [2022-12-06 05:36:39,625 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:36:39,625 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:36:39,625 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:36:39,696 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:36:39,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 170 flow [2022-12-06 05:36:39,754 INFO L130 PetriNetUnfolder]: 6/75 cut-off events. [2022-12-06 05:36:39,754 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:36:39,757 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 05:36:39,757 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 170 flow [2022-12-06 05:36:39,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 67 transitions, 146 flow [2022-12-06 05:36:39,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:39,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 67 transitions, 146 flow [2022-12-06 05:36:39,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 146 flow [2022-12-06 05:36:39,803 INFO L130 PetriNetUnfolder]: 6/67 cut-off events. [2022-12-06 05:36:39,803 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:36:39,804 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 05:36:39,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 67 transitions, 146 flow [2022-12-06 05:36:39,806 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 05:36:41,638 INFO L203 LiptonReduction]: Total number of compositions: 52 [2022-12-06 05:36:41,670 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:36:41,676 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;@2e0739ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:36:41,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:36:41,727 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-06 05:36:41,728 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:36:41,728 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:41,728 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:41,729 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 05:36:41,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:41,732 INFO L85 PathProgramCache]: Analyzing trace with hash 791724945, now seen corresponding path program 1 times [2022-12-06 05:36:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:41,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256138521] [2022-12-06 05:36:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:42,153 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 05:36:42,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:42,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256138521] [2022-12-06 05:36:42,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256138521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:42,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:42,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:36:42,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848641613] [2022-12-06 05:36:42,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:42,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:36:42,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:42,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:36:42,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:36:42,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-06 05:36:42,181 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 05:36:42,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:42,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-06 05:36:42,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:42,244 INFO L130 PetriNetUnfolder]: 63/112 cut-off events. [2022-12-06 05:36:42,245 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 05:36:42,245 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 05:36:42,246 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 17 selfloop transitions, 2 changer transitions 4/25 dead transitions. [2022-12-06 05:36:42,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 25 transitions, 117 flow [2022-12-06 05:36:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:36:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:36:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 05:36:42,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 05:36:42,257 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 3 states and 30 transitions. [2022-12-06 05:36:42,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 25 transitions, 117 flow [2022-12-06 05:36:42,260 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 05:36:42,262 INFO L231 Difference]: Finished difference. Result has 19 places, 16 transitions, 46 flow [2022-12-06 05:36:42,263 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 05:36:42,266 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2022-12-06 05:36:42,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:42,266 INFO L89 Accepts]: Start accepts. Operand has 19 places, 16 transitions, 46 flow [2022-12-06 05:36:42,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:42,270 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:42,270 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 16 transitions, 46 flow [2022-12-06 05:36:42,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 46 flow [2022-12-06 05:36:42,279 INFO L130 PetriNetUnfolder]: 2/20 cut-off events. [2022-12-06 05:36:42,280 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:36:42,280 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 05:36:42,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 16 transitions, 46 flow [2022-12-06 05:36:42,281 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 05:36:42,281 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:36:42,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 05:36:42,283 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 16 transitions, 46 flow [2022-12-06 05:36:42,283 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 05:36:42,283 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:42,283 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:42,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:36:42,287 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 05:36:42,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:42,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1574486509, now seen corresponding path program 1 times [2022-12-06 05:36:42,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:42,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807485512] [2022-12-06 05:36:42,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:42,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:42,416 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 05:36:42,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:42,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807485512] [2022-12-06 05:36:42,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807485512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:42,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:42,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:36:42,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143552695] [2022-12-06 05:36:42,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:42,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:36:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:42,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:36:42,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:36:42,419 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 05:36:42,419 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 05:36:42,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:42,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 05:36:42,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:42,516 INFO L130 PetriNetUnfolder]: 102/196 cut-off events. [2022-12-06 05:36:42,516 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 05:36:42,517 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 05:36:42,518 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 28 selfloop transitions, 3 changer transitions 6/37 dead transitions. [2022-12-06 05:36:42,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 37 transitions, 174 flow [2022-12-06 05:36:42,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:36:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:36:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-06 05:36:42,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-06 05:36:42,520 INFO L175 Difference]: Start difference. First operand has 19 places, 16 transitions, 46 flow. Second operand 5 states and 37 transitions. [2022-12-06 05:36:42,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 37 transitions, 174 flow [2022-12-06 05:36:42,521 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 05:36:42,522 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 70 flow [2022-12-06 05:36:42,522 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 05:36:42,522 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2022-12-06 05:36:42,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:42,523 INFO L89 Accepts]: Start accepts. Operand has 25 places, 18 transitions, 70 flow [2022-12-06 05:36:42,523 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:42,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:42,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 18 transitions, 70 flow [2022-12-06 05:36:42,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 70 flow [2022-12-06 05:36:42,529 INFO L130 PetriNetUnfolder]: 2/27 cut-off events. [2022-12-06 05:36:42,529 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:36:42,530 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 05:36:42,530 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 70 flow [2022-12-06 05:36:42,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 05:36:42,656 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:36:42,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-06 05:36:42,658 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 67 flow [2022-12-06 05:36:42,658 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 05:36:42,658 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:42,658 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:42,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:36:42,658 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 05:36:42,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:42,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1833465912, now seen corresponding path program 1 times [2022-12-06 05:36:42,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:42,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819840392] [2022-12-06 05:36:42,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:42,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:42,719 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 05:36:42,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:42,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819840392] [2022-12-06 05:36:42,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819840392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:42,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:42,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:36:42,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652939632] [2022-12-06 05:36:42,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:42,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:36:42,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:42,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:36:42,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:36:42,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 05:36:42,725 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 05:36:42,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:42,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 05:36:42,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:42,759 INFO L130 PetriNetUnfolder]: 57/106 cut-off events. [2022-12-06 05:36:42,760 INFO L131 PetriNetUnfolder]: For 201/208 co-relation queries the response was YES. [2022-12-06 05:36:42,762 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 05:36:42,763 INFO L137 encePairwiseOnDemand]: 14/16 looper letters, 14 selfloop transitions, 1 changer transitions 0/16 dead transitions. [2022-12-06 05:36:42,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 16 transitions, 90 flow [2022-12-06 05:36:42,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:36:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:36:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-12-06 05:36:42,764 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 05:36:42,764 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 67 flow. Second operand 3 states and 18 transitions. [2022-12-06 05:36:42,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 16 transitions, 90 flow [2022-12-06 05:36:42,765 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 05:36:42,766 INFO L231 Difference]: Finished difference. Result has 20 places, 16 transitions, 46 flow [2022-12-06 05:36:42,766 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 05:36:42,767 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 0 predicate places. [2022-12-06 05:36:42,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:42,767 INFO L89 Accepts]: Start accepts. Operand has 20 places, 16 transitions, 46 flow [2022-12-06 05:36:42,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:42,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:42,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 16 transitions, 46 flow [2022-12-06 05:36:42,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 46 flow [2022-12-06 05:36:42,771 INFO L130 PetriNetUnfolder]: 2/20 cut-off events. [2022-12-06 05:36:42,771 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:36:42,772 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 05:36:42,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 16 transitions, 46 flow [2022-12-06 05:36:42,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 05:36:42,772 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:36:42,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 05:36:42,773 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 16 transitions, 46 flow [2022-12-06 05:36:42,773 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 05:36:42,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:42,773 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:42,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:36:42,774 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 05:36:42,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:42,774 INFO L85 PathProgramCache]: Analyzing trace with hash 460243900, now seen corresponding path program 1 times [2022-12-06 05:36:42,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:42,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112793641] [2022-12-06 05:36:42,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:42,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:42,954 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 05:36:42,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:42,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112793641] [2022-12-06 05:36:42,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112793641] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:36:42,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420608718] [2022-12-06 05:36:42,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:42,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:36:42,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:36:42,971 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 05:36:42,975 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 05:36:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:43,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 05:36:43,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:36:43,192 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 05:36:43,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:36:43,369 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 05:36:43,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420608718] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:36:43,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:36:43,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:36:43,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384301303] [2022-12-06 05:36:43,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:36:43,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:36:43,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:43,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:36:43,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:36:43,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 05:36:43,374 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 05:36:43,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:43,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 05:36:43,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:43,641 INFO L130 PetriNetUnfolder]: 138/250 cut-off events. [2022-12-06 05:36:43,642 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 05:36:43,642 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 05:36:43,643 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 42 selfloop transitions, 18 changer transitions 17/77 dead transitions. [2022-12-06 05:36:43,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 77 transitions, 350 flow [2022-12-06 05:36:43,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:36:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:36:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-12-06 05:36:43,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2022-12-06 05:36:43,644 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 46 flow. Second operand 11 states and 80 transitions. [2022-12-06 05:36:43,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 77 transitions, 350 flow [2022-12-06 05:36:43,645 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 05:36:43,646 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 160 flow [2022-12-06 05:36:43,646 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 05:36:43,646 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 15 predicate places. [2022-12-06 05:36:43,646 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:43,646 INFO L89 Accepts]: Start accepts. Operand has 35 places, 30 transitions, 160 flow [2022-12-06 05:36:43,647 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:43,647 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:43,647 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 30 transitions, 160 flow [2022-12-06 05:36:43,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 30 transitions, 160 flow [2022-12-06 05:36:43,652 INFO L130 PetriNetUnfolder]: 16/66 cut-off events. [2022-12-06 05:36:43,652 INFO L131 PetriNetUnfolder]: For 27/28 co-relation queries the response was YES. [2022-12-06 05:36:43,653 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 05:36:43,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 30 transitions, 160 flow [2022-12-06 05:36:43,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 05:36:43,811 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:43,811 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:44,050 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 05:36:44,183 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:36:44,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 537 [2022-12-06 05:36:44,184 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 164 flow [2022-12-06 05:36:44,184 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 05:36:44,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:44,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:44,192 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 05:36:44,384 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 05:36:44,385 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 05:36:44,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:44,385 INFO L85 PathProgramCache]: Analyzing trace with hash 647042430, now seen corresponding path program 2 times [2022-12-06 05:36:44,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:44,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236072630] [2022-12-06 05:36:44,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:44,458 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 05:36:44,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:44,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236072630] [2022-12-06 05:36:44,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236072630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:44,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:44,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:36:44,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875524523] [2022-12-06 05:36:44,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:44,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:36:44,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:44,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:36:44,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:36:44,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 05:36:44,462 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 05:36:44,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:44,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 05:36:44,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:44,526 INFO L130 PetriNetUnfolder]: 122/222 cut-off events. [2022-12-06 05:36:44,526 INFO L131 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2022-12-06 05:36:44,527 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 05:36:44,527 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 32 selfloop transitions, 8 changer transitions 5/46 dead transitions. [2022-12-06 05:36:44,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 313 flow [2022-12-06 05:36:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:36:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:36:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 05:36:44,529 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-06 05:36:44,529 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 164 flow. Second operand 5 states and 44 transitions. [2022-12-06 05:36:44,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 313 flow [2022-12-06 05:36:44,533 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 05:36:44,534 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 175 flow [2022-12-06 05:36:44,534 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 05:36:44,536 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2022-12-06 05:36:44,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:44,536 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 175 flow [2022-12-06 05:36:44,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:44,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:44,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 175 flow [2022-12-06 05:36:44,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 175 flow [2022-12-06 05:36:44,544 INFO L130 PetriNetUnfolder]: 18/68 cut-off events. [2022-12-06 05:36:44,544 INFO L131 PetriNetUnfolder]: For 48/52 co-relation queries the response was YES. [2022-12-06 05:36:44,544 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 05:36:44,545 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 175 flow [2022-12-06 05:36:44,545 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 05:36:44,547 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:36:44,547 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:36:44,547 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 175 flow [2022-12-06 05:36:44,547 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 05:36:44,547 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:44,548 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:44,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:36:44,548 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 05:36:44,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1731997393, now seen corresponding path program 1 times [2022-12-06 05:36:44,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:44,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129477489] [2022-12-06 05:36:44,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:44,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:44,624 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 05:36:44,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:44,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129477489] [2022-12-06 05:36:44,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129477489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:44,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:44,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:36:44,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188093796] [2022-12-06 05:36:44,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:44,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:36:44,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:44,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:36:44,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:36:44,626 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:36:44,626 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 05:36:44,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:44,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:36:44,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:44,697 INFO L130 PetriNetUnfolder]: 167/309 cut-off events. [2022-12-06 05:36:44,697 INFO L131 PetriNetUnfolder]: For 383/383 co-relation queries the response was YES. [2022-12-06 05:36:44,698 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 05:36:44,699 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 44 selfloop transitions, 6 changer transitions 4/54 dead transitions. [2022-12-06 05:36:44,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 391 flow [2022-12-06 05:36:44,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:36:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:36:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 05:36:44,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 05:36:44,700 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 175 flow. Second operand 4 states and 42 transitions. [2022-12-06 05:36:44,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 391 flow [2022-12-06 05:36:44,701 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 05:36:44,702 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 184 flow [2022-12-06 05:36:44,702 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 05:36:44,702 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 19 predicate places. [2022-12-06 05:36:44,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:44,703 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 184 flow [2022-12-06 05:36:44,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:44,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:44,703 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 184 flow [2022-12-06 05:36:44,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 184 flow [2022-12-06 05:36:44,709 INFO L130 PetriNetUnfolder]: 18/77 cut-off events. [2022-12-06 05:36:44,709 INFO L131 PetriNetUnfolder]: For 59/62 co-relation queries the response was YES. [2022-12-06 05:36:44,709 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 05:36:44,709 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 184 flow [2022-12-06 05:36:44,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 05:36:44,710 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:36:44,711 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 05:36:44,711 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 184 flow [2022-12-06 05:36:44,711 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 05:36:44,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:44,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:44,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:36:44,711 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 05:36:44,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:44,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1330860404, now seen corresponding path program 1 times [2022-12-06 05:36:44,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:44,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738898691] [2022-12-06 05:36:44,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:44,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:44,959 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 05:36:44,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:44,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738898691] [2022-12-06 05:36:44,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738898691] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:36:44,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280804215] [2022-12-06 05:36:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:44,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:36:44,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:36:44,961 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 05:36:44,984 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 05:36:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:45,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 05:36:45,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:36:45,180 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 05:36:45,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:36:45,318 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 05:36:45,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280804215] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:36:45,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:36:45,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 05:36:45,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010231575] [2022-12-06 05:36:45,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:36:45,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:36:45,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:45,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:36:45,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:36:45,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:36:45,320 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 05:36:45,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:45,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:36:45,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:46,314 INFO L130 PetriNetUnfolder]: 323/588 cut-off events. [2022-12-06 05:36:46,314 INFO L131 PetriNetUnfolder]: For 699/699 co-relation queries the response was YES. [2022-12-06 05:36:46,315 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 05:36:46,317 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 60 selfloop transitions, 32 changer transitions 20/112 dead transitions. [2022-12-06 05:36:46,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 112 transitions, 707 flow [2022-12-06 05:36:46,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:36:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:36:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-12-06 05:36:46,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4291497975708502 [2022-12-06 05:36:46,318 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 184 flow. Second operand 13 states and 106 transitions. [2022-12-06 05:36:46,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 112 transitions, 707 flow [2022-12-06 05:36:46,320 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 05:36:46,321 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 403 flow [2022-12-06 05:36:46,321 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 05:36:46,322 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2022-12-06 05:36:46,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:46,322 INFO L89 Accepts]: Start accepts. Operand has 56 places, 50 transitions, 403 flow [2022-12-06 05:36:46,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:46,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:46,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 50 transitions, 403 flow [2022-12-06 05:36:46,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 403 flow [2022-12-06 05:36:46,332 INFO L130 PetriNetUnfolder]: 34/150 cut-off events. [2022-12-06 05:36:46,332 INFO L131 PetriNetUnfolder]: For 287/296 co-relation queries the response was YES. [2022-12-06 05:36:46,333 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 05:36:46,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 50 transitions, 403 flow [2022-12-06 05:36:46,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-06 05:36:46,340 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 05:36:46,434 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 05:36:46,434 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:46,434 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:46,699 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 05:36:46,878 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 05:36:46,993 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 05:36:47,001 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 05:36:47,316 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 05:36:47,504 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:36:47,504 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1182 [2022-12-06 05:36:47,504 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 457 flow [2022-12-06 05:36:47,505 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 05:36:47,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:47,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:47,511 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 05:36:47,705 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 05:36:47,705 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 05:36:47,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:47,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1124682173, now seen corresponding path program 1 times [2022-12-06 05:36:47,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:47,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343571823] [2022-12-06 05:36:47,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:47,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:47,811 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 05:36:47,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:47,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343571823] [2022-12-06 05:36:47,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343571823] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:36:47,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187449255] [2022-12-06 05:36:47,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:47,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:36:47,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:36:47,812 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 05:36:47,814 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 05:36:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:47,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:36:47,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:36:47,919 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 05:36:47,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:36:47,971 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 05:36:47,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187449255] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:36:47,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:36:47,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2022-12-06 05:36:47,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182611985] [2022-12-06 05:36:47,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:47,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:36:47,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:47,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:36:47,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:36:47,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:36:47,973 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 05:36:47,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:47,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:36:47,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:48,183 INFO L130 PetriNetUnfolder]: 428/851 cut-off events. [2022-12-06 05:36:48,183 INFO L131 PetriNetUnfolder]: For 3438/3438 co-relation queries the response was YES. [2022-12-06 05:36:48,185 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 05:36:48,188 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 59 selfloop transitions, 23 changer transitions 9/91 dead transitions. [2022-12-06 05:36:48,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 91 transitions, 915 flow [2022-12-06 05:36:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:36:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:36:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 05:36:48,190 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4148148148148148 [2022-12-06 05:36:48,190 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 457 flow. Second operand 5 states and 56 transitions. [2022-12-06 05:36:48,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 91 transitions, 915 flow [2022-12-06 05:36:48,200 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 05:36:48,202 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 601 flow [2022-12-06 05:36:48,202 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 05:36:48,203 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 40 predicate places. [2022-12-06 05:36:48,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:48,203 INFO L89 Accepts]: Start accepts. Operand has 60 places, 60 transitions, 601 flow [2022-12-06 05:36:48,205 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:48,205 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:48,205 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 60 transitions, 601 flow [2022-12-06 05:36:48,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 601 flow [2022-12-06 05:36:48,226 INFO L130 PetriNetUnfolder]: 63/267 cut-off events. [2022-12-06 05:36:48,226 INFO L131 PetriNetUnfolder]: For 708/728 co-relation queries the response was YES. [2022-12-06 05:36:48,227 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 05:36:48,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 60 transitions, 601 flow [2022-12-06 05:36:48,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 05:36:48,232 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 05:36:48,343 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 05:36:48,432 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 05:36:48,499 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:36:48,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 297 [2022-12-06 05:36:48,500 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 615 flow [2022-12-06 05:36:48,500 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 05:36:48,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:48,500 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:48,508 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 05:36:48,701 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 05:36:48,701 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 05:36:48,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:48,701 INFO L85 PathProgramCache]: Analyzing trace with hash -605884865, now seen corresponding path program 1 times [2022-12-06 05:36:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:48,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663273493] [2022-12-06 05:36:48,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:48,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:48,904 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 05:36:48,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:48,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663273493] [2022-12-06 05:36:48,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663273493] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:36:48,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644521193] [2022-12-06 05:36:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:48,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:36:48,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:36:48,906 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 05:36:48,939 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 05:36:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:48,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 05:36:48,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:36:49,062 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 05:36:49,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:36:49,377 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 05:36:49,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644521193] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:36:49,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:36:49,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 05:36:49,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763694931] [2022-12-06 05:36:49,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:36:49,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:36:49,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:49,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:36:49,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:36:49,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:36:49,378 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 05:36:49,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:49,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:36:49,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:49,721 INFO L130 PetriNetUnfolder]: 391/782 cut-off events. [2022-12-06 05:36:49,721 INFO L131 PetriNetUnfolder]: For 3584/3584 co-relation queries the response was YES. [2022-12-06 05:36:49,723 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 05:36:49,726 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 57 selfloop transitions, 23 changer transitions 15/95 dead transitions. [2022-12-06 05:36:49,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 1027 flow [2022-12-06 05:36:49,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:36:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:36:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-12-06 05:36:49,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-06 05:36:49,727 INFO L175 Difference]: Start difference. First operand has 57 places, 59 transitions, 615 flow. Second operand 8 states and 63 transitions. [2022-12-06 05:36:49,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 1027 flow [2022-12-06 05:36:49,737 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 05:36:49,738 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 639 flow [2022-12-06 05:36:49,738 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 05:36:49,738 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 44 predicate places. [2022-12-06 05:36:49,739 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:49,739 INFO L89 Accepts]: Start accepts. Operand has 64 places, 59 transitions, 639 flow [2022-12-06 05:36:49,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:49,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:49,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 59 transitions, 639 flow [2022-12-06 05:36:49,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 59 transitions, 639 flow [2022-12-06 05:36:49,759 INFO L130 PetriNetUnfolder]: 60/265 cut-off events. [2022-12-06 05:36:49,759 INFO L131 PetriNetUnfolder]: For 747/762 co-relation queries the response was YES. [2022-12-06 05:36:49,760 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 05:36:49,761 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 59 transitions, 639 flow [2022-12-06 05:36:49,761 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-06 05:36:49,780 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 05:36:49,884 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 05:36:49,885 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:49,885 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:50,114 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 05:36:50,214 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 05:36:50,215 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:50,215 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:50,592 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 05:36:50,689 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 05:36:51,005 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 05:36:51,103 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 05:36:51,436 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:36:51,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1698 [2022-12-06 05:36:51,437 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 758 flow [2022-12-06 05:36:51,437 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 05:36:51,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:51,437 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:51,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 05:36:51,638 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 05:36:51,638 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 05:36:51,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:51,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1533971526, now seen corresponding path program 1 times [2022-12-06 05:36:51,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:51,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957466563] [2022-12-06 05:36:51,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:51,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:51,811 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 05:36:51,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:51,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957466563] [2022-12-06 05:36:51,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957466563] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:36:51,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032052006] [2022-12-06 05:36:51,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:51,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:36:51,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:36:51,818 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 05:36:51,870 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 05:36:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:51,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:36:51,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:36:51,993 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 05:36:51,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:36:52,234 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 05:36:52,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032052006] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:36:52,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:36:52,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 05:36:52,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513997967] [2022-12-06 05:36:52,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:36:52,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:36:52,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:52,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:36:52,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:36:52,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:36:52,236 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 05:36:52,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:52,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:36:52,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:52,751 INFO L130 PetriNetUnfolder]: 452/917 cut-off events. [2022-12-06 05:36:52,751 INFO L131 PetriNetUnfolder]: For 4694/4694 co-relation queries the response was YES. [2022-12-06 05:36:52,752 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 05:36:52,755 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 63 selfloop transitions, 27 changer transitions 25/115 dead transitions. [2022-12-06 05:36:52,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 115 transitions, 1238 flow [2022-12-06 05:36:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:36:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:36:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 81 transitions. [2022-12-06 05:36:52,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19285714285714287 [2022-12-06 05:36:52,757 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 758 flow. Second operand 12 states and 81 transitions. [2022-12-06 05:36:52,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 115 transitions, 1238 flow [2022-12-06 05:36:52,790 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 05:36:52,792 INFO L231 Difference]: Finished difference. Result has 77 places, 67 transitions, 776 flow [2022-12-06 05:36:52,792 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 05:36:52,793 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 57 predicate places. [2022-12-06 05:36:52,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:52,793 INFO L89 Accepts]: Start accepts. Operand has 77 places, 67 transitions, 776 flow [2022-12-06 05:36:52,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:52,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:52,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 67 transitions, 776 flow [2022-12-06 05:36:52,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 67 transitions, 776 flow [2022-12-06 05:36:52,816 INFO L130 PetriNetUnfolder]: 81/315 cut-off events. [2022-12-06 05:36:52,817 INFO L131 PetriNetUnfolder]: For 2228/2230 co-relation queries the response was YES. [2022-12-06 05:36:52,817 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 05:36:52,819 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 67 transitions, 776 flow [2022-12-06 05:36:52,819 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 05:36:52,827 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:52,828 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:53,136 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 05:36:53,311 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 05:36:53,919 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:53,920 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:53,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 05:36:54,120 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 05:36:54,121 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 05:36:54,124 INFO L158 Benchmark]: Toolchain (without parser) took 15105.33ms. Allocated memory was 182.5MB in the beginning and 339.7MB in the end (delta: 157.3MB). Free memory was 159.7MB in the beginning and 240.6MB in the end (delta: -81.0MB). Peak memory consumption was 77.3MB. Max. memory is 8.0GB. [2022-12-06 05:36:54,124 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:36:54,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.57ms. Allocated memory is still 182.5MB. Free memory was 159.4MB in the beginning and 148.4MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:36:54,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.24ms. Allocated memory is still 182.5MB. Free memory was 147.8MB in the beginning and 146.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:36:54,125 INFO L158 Benchmark]: Boogie Preprocessor took 28.19ms. Allocated memory is still 182.5MB. Free memory was 146.3MB in the beginning and 145.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:36:54,125 INFO L158 Benchmark]: RCFGBuilder took 334.70ms. Allocated memory is still 182.5MB. Free memory was 145.2MB in the beginning and 131.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 05:36:54,125 INFO L158 Benchmark]: TraceAbstraction took 14531.37ms. Allocated memory was 182.5MB in the beginning and 339.7MB in the end (delta: 157.3MB). Free memory was 131.1MB in the beginning and 240.6MB in the end (delta: -109.6MB). Peak memory consumption was 49.0MB. Max. memory is 8.0GB. [2022-12-06 05:36:54,126 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.11ms. Allocated memory is still 182.5MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.57ms. Allocated memory is still 182.5MB. Free memory was 159.4MB in the beginning and 148.4MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.24ms. Allocated memory is still 182.5MB. Free memory was 147.8MB in the beginning and 146.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.19ms. Allocated memory is still 182.5MB. Free memory was 146.3MB in the beginning and 145.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 334.70ms. Allocated memory is still 182.5MB. Free memory was 145.2MB in the beginning and 131.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 14531.37ms. Allocated memory was 182.5MB in the beginning and 339.7MB in the end (delta: 157.3MB). Free memory was 131.1MB in the beginning and 240.6MB in the end (delta: -109.6MB). Peak memory consumption was 49.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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.1s, 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.5s, 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.2s, 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: 1.7s, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, 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 05:36:54,164 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...