/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-RepeatedSemanticLbeWithDisjunctivePredicates.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 07:44:00,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:44:00,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:44:00,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:44:00,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:44:00,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:44:00,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:44:00,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:44:00,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:44:00,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:44:00,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:44:00,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:44:00,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:44:00,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:44:00,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:44:00,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:44:00,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:44:00,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:44:00,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:44:00,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:44:00,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:44:00,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:44:00,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:44:00,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:44:00,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:44:00,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:44:00,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:44:00,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:44:00,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:44:00,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:44:00,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:44:00,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:44:00,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:44:00,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:44:00,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:44:00,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:44:00,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:44:00,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:44:00,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:44:00,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:44:00,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:44:00,643 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:44:00,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:44:00,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:44:00,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:44:00,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:44:00,705 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:44:00,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:44:00,706 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:44:00,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:44:00,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:44:00,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:44:00,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:44:00,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:44:00,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:44:00,707 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:44:00,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:44:00,707 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:44:00,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:44:00,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:44:00,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:44:00,708 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:44:00,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:44:00,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:44:00,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:44:00,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:44:00,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:44:00,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:44:00,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:44:00,709 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:44:00,709 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 07:44:00,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:44:00,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:44:00,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:44:00,998 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:44:00,998 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:44:00,999 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 07:44:01,913 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:44:02,118 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:44:02,120 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2022-12-06 07:44:02,128 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8768ca4f/892fabf92de446a1885005071a24111a/FLAG117009fe6 [2022-12-06 07:44:02,138 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8768ca4f/892fabf92de446a1885005071a24111a [2022-12-06 07:44:02,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:44:02,140 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:44:02,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:44:02,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:44:02,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:44:02,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:44:02" (1/1) ... [2022-12-06 07:44:02,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef47124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:02, skipping insertion in model container [2022-12-06 07:44:02,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:44:02" (1/1) ... [2022-12-06 07:44:02,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:44:02,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:44:02,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:44:02,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:44:02,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:44:02,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:44:02,270 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 07:44:02,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:44:02,280 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:44:02,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:44:02,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:44:02,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:44:02,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:44:02,303 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 07:44:02,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:44:02,317 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:44:02,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:02 WrapperNode [2022-12-06 07:44:02,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:44:02,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:44:02,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:44:02,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:44:02,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:02" (1/1) ... [2022-12-06 07:44:02,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:02" (1/1) ... [2022-12-06 07:44:02,343 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2022-12-06 07:44:02,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:44:02,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:44:02,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:44:02,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:44:02,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:02" (1/1) ... [2022-12-06 07:44:02,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:02" (1/1) ... [2022-12-06 07:44:02,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:02" (1/1) ... [2022-12-06 07:44:02,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:02" (1/1) ... [2022-12-06 07:44:02,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:02" (1/1) ... [2022-12-06 07:44:02,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:02" (1/1) ... [2022-12-06 07:44:02,370 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:02" (1/1) ... [2022-12-06 07:44:02,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:02" (1/1) ... [2022-12-06 07:44:02,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:44:02,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:44:02,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:44:02,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:44:02,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:02" (1/1) ... [2022-12-06 07:44:02,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:44:02,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:02,408 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 07:44:02,431 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 07:44:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:44:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:44:02,444 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:44:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:44:02,444 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:44:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:44:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:44:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:44:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:44:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:44:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:44:02,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:44:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:44:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:44:02,446 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 07:44:02,531 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:44:02,532 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:44:02,716 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:44:02,753 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:44:02,753 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 07:44:02,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:44:02 BoogieIcfgContainer [2022-12-06 07:44:02,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:44:02,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:44:02,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:44:02,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:44:02,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:44:02" (1/3) ... [2022-12-06 07:44:02,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2f1b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:44:02, skipping insertion in model container [2022-12-06 07:44:02,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:02" (2/3) ... [2022-12-06 07:44:02,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2f1b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:44:02, skipping insertion in model container [2022-12-06 07:44:02,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:44:02" (3/3) ... [2022-12-06 07:44:02,765 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-nonblocking-counter-alt2.wvr.c [2022-12-06 07:44:02,778 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:44:02,778 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:44:02,778 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:44:02,829 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:44:02,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 170 flow [2022-12-06 07:44:02,886 INFO L130 PetriNetUnfolder]: 6/75 cut-off events. [2022-12-06 07:44:02,886 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:44:02,889 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 07:44:02,890 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 170 flow [2022-12-06 07:44:02,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 67 transitions, 146 flow [2022-12-06 07:44:02,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:02,905 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 67 transitions, 146 flow [2022-12-06 07:44:02,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 146 flow [2022-12-06 07:44:02,923 INFO L130 PetriNetUnfolder]: 6/67 cut-off events. [2022-12-06 07:44:02,923 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:44:02,924 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 07:44:02,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 67 transitions, 146 flow [2022-12-06 07:44:02,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 07:44:05,041 INFO L203 LiptonReduction]: Total number of compositions: 52 [2022-12-06 07:44:05,062 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:44:05,067 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=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;@203d3619, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:44:05,067 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:44:05,070 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-06 07:44:05,070 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:44:05,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:05,076 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:05,077 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 07:44:05,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:05,083 INFO L85 PathProgramCache]: Analyzing trace with hash 791724945, now seen corresponding path program 1 times [2022-12-06 07:44:05,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:05,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232658269] [2022-12-06 07:44:05,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:05,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:05,445 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 07:44:05,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:05,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232658269] [2022-12-06 07:44:05,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232658269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:05,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:05,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:44:05,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445009297] [2022-12-06 07:44:05,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:05,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:44:05,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:05,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:44:05,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:44:05,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-06 07:44:05,472 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 07:44:05,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:05,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-06 07:44:05,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:05,539 INFO L130 PetriNetUnfolder]: 63/112 cut-off events. [2022-12-06 07:44:05,540 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 07:44:05,540 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 07:44:05,543 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 17 selfloop transitions, 2 changer transitions 4/25 dead transitions. [2022-12-06 07:44:05,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 25 transitions, 117 flow [2022-12-06 07:44:05,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:44:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:44:05,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 07:44:05,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 07:44:05,552 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 3 states and 30 transitions. [2022-12-06 07:44:05,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 25 transitions, 117 flow [2022-12-06 07:44:05,554 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 07:44:05,556 INFO L231 Difference]: Finished difference. Result has 19 places, 16 transitions, 46 flow [2022-12-06 07:44:05,557 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 07:44:05,560 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2022-12-06 07:44:05,560 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:05,561 INFO L89 Accepts]: Start accepts. Operand has 19 places, 16 transitions, 46 flow [2022-12-06 07:44:05,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:05,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:05,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 16 transitions, 46 flow [2022-12-06 07:44:05,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 46 flow [2022-12-06 07:44:05,572 INFO L130 PetriNetUnfolder]: 2/20 cut-off events. [2022-12-06 07:44:05,572 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:44:05,573 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 07:44:05,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 16 transitions, 46 flow [2022-12-06 07:44:05,573 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 07:44:05,573 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:05,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 07:44:05,575 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 16 transitions, 46 flow [2022-12-06 07:44:05,576 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 07:44:05,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:05,576 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:05,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:44:05,579 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 07:44:05,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:05,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1574486509, now seen corresponding path program 1 times [2022-12-06 07:44:05,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:05,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957055143] [2022-12-06 07:44:05,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:05,694 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 07:44:05,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:05,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957055143] [2022-12-06 07:44:05,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957055143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:05,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:05,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:44:05,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524710377] [2022-12-06 07:44:05,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:05,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:44:05,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:05,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:44:05,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:44:05,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 07:44:05,698 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 07:44:05,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:05,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 07:44:05,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:05,791 INFO L130 PetriNetUnfolder]: 102/196 cut-off events. [2022-12-06 07:44:05,792 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 07:44:05,792 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 07:44:05,793 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 28 selfloop transitions, 3 changer transitions 6/37 dead transitions. [2022-12-06 07:44:05,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 37 transitions, 174 flow [2022-12-06 07:44:05,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:44:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:44:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-06 07:44:05,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-06 07:44:05,795 INFO L175 Difference]: Start difference. First operand has 19 places, 16 transitions, 46 flow. Second operand 5 states and 37 transitions. [2022-12-06 07:44:05,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 37 transitions, 174 flow [2022-12-06 07:44:05,796 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 07:44:05,797 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 70 flow [2022-12-06 07:44:05,797 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 07:44:05,798 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2022-12-06 07:44:05,798 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:05,798 INFO L89 Accepts]: Start accepts. Operand has 25 places, 18 transitions, 70 flow [2022-12-06 07:44:05,799 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:05,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:05,799 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 18 transitions, 70 flow [2022-12-06 07:44:05,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 70 flow [2022-12-06 07:44:05,804 INFO L130 PetriNetUnfolder]: 2/27 cut-off events. [2022-12-06 07:44:05,804 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:44:05,805 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 07:44:05,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 70 flow [2022-12-06 07:44:05,805 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 07:44:05,929 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:44:05,930 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-06 07:44:05,930 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 67 flow [2022-12-06 07:44:05,930 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 07:44:05,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:05,930 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:05,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:44:05,931 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 07:44:05,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:05,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1833465912, now seen corresponding path program 1 times [2022-12-06 07:44:05,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:05,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179382148] [2022-12-06 07:44:05,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:05,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:06,014 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 07:44:06,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:06,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179382148] [2022-12-06 07:44:06,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179382148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:06,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:06,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:44:06,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11214667] [2022-12-06 07:44:06,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:06,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:44:06,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:06,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:44:06,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:44:06,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 07:44:06,021 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 07:44:06,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:06,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 07:44:06,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:06,049 INFO L130 PetriNetUnfolder]: 57/106 cut-off events. [2022-12-06 07:44:06,049 INFO L131 PetriNetUnfolder]: For 201/208 co-relation queries the response was YES. [2022-12-06 07:44:06,051 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 07:44:06,053 INFO L137 encePairwiseOnDemand]: 14/16 looper letters, 14 selfloop transitions, 1 changer transitions 0/16 dead transitions. [2022-12-06 07:44:06,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 16 transitions, 90 flow [2022-12-06 07:44:06,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:44:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:44:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-12-06 07:44:06,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 07:44:06,054 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 67 flow. Second operand 3 states and 18 transitions. [2022-12-06 07:44:06,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 16 transitions, 90 flow [2022-12-06 07:44:06,055 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 07:44:06,055 INFO L231 Difference]: Finished difference. Result has 20 places, 16 transitions, 46 flow [2022-12-06 07:44:06,056 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 07:44:06,057 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 0 predicate places. [2022-12-06 07:44:06,057 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:06,057 INFO L89 Accepts]: Start accepts. Operand has 20 places, 16 transitions, 46 flow [2022-12-06 07:44:06,057 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:06,057 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:06,058 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 16 transitions, 46 flow [2022-12-06 07:44:06,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 46 flow [2022-12-06 07:44:06,060 INFO L130 PetriNetUnfolder]: 2/20 cut-off events. [2022-12-06 07:44:06,061 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:44:06,061 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 07:44:06,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 16 transitions, 46 flow [2022-12-06 07:44:06,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 07:44:06,062 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:06,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 07:44:06,062 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 16 transitions, 46 flow [2022-12-06 07:44:06,063 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 07:44:06,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:06,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:06,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:44:06,063 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 07:44:06,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash 460243900, now seen corresponding path program 1 times [2022-12-06 07:44:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:06,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19666132] [2022-12-06 07:44:06,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:06,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:06,276 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 07:44:06,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:06,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19666132] [2022-12-06 07:44:06,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19666132] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:06,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506993077] [2022-12-06 07:44:06,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:06,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:06,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:06,280 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 07:44:06,296 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 07:44:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:06,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 07:44:06,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:06,464 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 07:44:06,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:44:06,606 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 07:44:06,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506993077] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:44:06,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:44:06,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 07:44:06,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602376016] [2022-12-06 07:44:06,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:44:06,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:44:06,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:06,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:44:06,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:44:06,608 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 07:44:06,608 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 07:44:06,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:06,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 07:44:06,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:06,876 INFO L130 PetriNetUnfolder]: 138/250 cut-off events. [2022-12-06 07:44:06,876 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 07:44:06,877 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 07:44:06,878 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 42 selfloop transitions, 18 changer transitions 17/77 dead transitions. [2022-12-06 07:44:06,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 77 transitions, 350 flow [2022-12-06 07:44:06,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:44:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:44:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-12-06 07:44:06,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2022-12-06 07:44:06,879 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 46 flow. Second operand 11 states and 80 transitions. [2022-12-06 07:44:06,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 77 transitions, 350 flow [2022-12-06 07:44:06,880 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 07:44:06,881 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 160 flow [2022-12-06 07:44:06,881 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 07:44:06,882 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 15 predicate places. [2022-12-06 07:44:06,882 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:06,882 INFO L89 Accepts]: Start accepts. Operand has 35 places, 30 transitions, 160 flow [2022-12-06 07:44:06,883 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:06,883 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:06,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 30 transitions, 160 flow [2022-12-06 07:44:06,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 30 transitions, 160 flow [2022-12-06 07:44:06,890 INFO L130 PetriNetUnfolder]: 16/66 cut-off events. [2022-12-06 07:44:06,890 INFO L131 PetriNetUnfolder]: For 27/28 co-relation queries the response was YES. [2022-12-06 07:44:06,890 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 07:44:06,890 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 30 transitions, 160 flow [2022-12-06 07:44:06,891 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 07:44:07,039 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:07,039 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:07,272 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 07:44:07,392 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:44:07,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 511 [2022-12-06 07:44:07,393 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 164 flow [2022-12-06 07:44:07,393 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 07:44:07,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:07,393 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:07,410 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 07:44:07,593 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 07:44:07,594 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 07:44:07,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:07,594 INFO L85 PathProgramCache]: Analyzing trace with hash 647042430, now seen corresponding path program 2 times [2022-12-06 07:44:07,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:07,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149388934] [2022-12-06 07:44:07,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:07,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:07,695 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 07:44:07,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:07,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149388934] [2022-12-06 07:44:07,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149388934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:07,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:07,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:44:07,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8646313] [2022-12-06 07:44:07,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:07,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:44:07,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:07,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:44:07,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:44:07,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 07:44:07,697 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 07:44:07,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:07,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 07:44:07,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:07,772 INFO L130 PetriNetUnfolder]: 122/222 cut-off events. [2022-12-06 07:44:07,773 INFO L131 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2022-12-06 07:44:07,773 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 07:44:07,774 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 32 selfloop transitions, 8 changer transitions 5/46 dead transitions. [2022-12-06 07:44:07,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 313 flow [2022-12-06 07:44:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:44:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:44:07,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 07:44:07,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-06 07:44:07,775 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 164 flow. Second operand 5 states and 44 transitions. [2022-12-06 07:44:07,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 313 flow [2022-12-06 07:44:07,777 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 07:44:07,778 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 175 flow [2022-12-06 07:44:07,778 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 07:44:07,779 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2022-12-06 07:44:07,779 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:07,779 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 175 flow [2022-12-06 07:44:07,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:07,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:07,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 175 flow [2022-12-06 07:44:07,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 175 flow [2022-12-06 07:44:07,785 INFO L130 PetriNetUnfolder]: 18/68 cut-off events. [2022-12-06 07:44:07,786 INFO L131 PetriNetUnfolder]: For 48/52 co-relation queries the response was YES. [2022-12-06 07:44:07,786 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 07:44:07,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 175 flow [2022-12-06 07:44:07,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 07:44:07,787 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:07,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 07:44:07,788 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 175 flow [2022-12-06 07:44:07,788 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 07:44:07,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:07,788 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:07,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:44:07,789 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 07:44:07,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1731997393, now seen corresponding path program 1 times [2022-12-06 07:44:07,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:07,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850287859] [2022-12-06 07:44:07,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:07,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:07,859 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 07:44:07,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:07,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850287859] [2022-12-06 07:44:07,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850287859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:07,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:07,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:44:07,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950994443] [2022-12-06 07:44:07,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:07,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:44:07,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:07,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:44:07,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:44:07,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 07:44:07,861 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 07:44:07,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:07,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 07:44:07,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:07,933 INFO L130 PetriNetUnfolder]: 167/309 cut-off events. [2022-12-06 07:44:07,933 INFO L131 PetriNetUnfolder]: For 383/383 co-relation queries the response was YES. [2022-12-06 07:44:07,934 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 07:44:07,935 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 44 selfloop transitions, 6 changer transitions 4/54 dead transitions. [2022-12-06 07:44:07,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 391 flow [2022-12-06 07:44:07,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:44:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:44:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 07:44:07,935 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 07:44:07,936 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 175 flow. Second operand 4 states and 42 transitions. [2022-12-06 07:44:07,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 391 flow [2022-12-06 07:44:07,937 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 07:44:07,938 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 184 flow [2022-12-06 07:44:07,938 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 07:44:07,938 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 19 predicate places. [2022-12-06 07:44:07,939 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:07,939 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 184 flow [2022-12-06 07:44:07,939 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:07,939 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:07,939 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 184 flow [2022-12-06 07:44:07,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 184 flow [2022-12-06 07:44:07,944 INFO L130 PetriNetUnfolder]: 18/77 cut-off events. [2022-12-06 07:44:07,945 INFO L131 PetriNetUnfolder]: For 59/62 co-relation queries the response was YES. [2022-12-06 07:44:07,945 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 07:44:07,945 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 184 flow [2022-12-06 07:44:07,945 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 07:44:07,946 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:07,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 07:44:07,946 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 184 flow [2022-12-06 07:44:07,946 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 07:44:07,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:07,947 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:07,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:44:07,947 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 07:44:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:07,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1330860404, now seen corresponding path program 1 times [2022-12-06 07:44:07,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:07,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7360294] [2022-12-06 07:44:07,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:07,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:08,196 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 07:44:08,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:08,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7360294] [2022-12-06 07:44:08,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7360294] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:08,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031706358] [2022-12-06 07:44:08,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:08,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:08,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:08,198 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 07:44:08,200 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 07:44:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:08,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 07:44:08,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:08,431 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 07:44:08,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:44:08,609 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 07:44:08,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031706358] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:44:08,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:44:08,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 07:44:08,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807380771] [2022-12-06 07:44:08,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:44:08,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:44:08,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:08,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:44:08,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:44:08,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:44:08,611 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 07:44:08,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:08,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:44:08,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:09,641 INFO L130 PetriNetUnfolder]: 323/588 cut-off events. [2022-12-06 07:44:09,641 INFO L131 PetriNetUnfolder]: For 699/699 co-relation queries the response was YES. [2022-12-06 07:44:09,642 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 07:44:09,644 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 60 selfloop transitions, 32 changer transitions 20/112 dead transitions. [2022-12-06 07:44:09,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 112 transitions, 707 flow [2022-12-06 07:44:09,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:44:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:44:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-12-06 07:44:09,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4291497975708502 [2022-12-06 07:44:09,646 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 184 flow. Second operand 13 states and 106 transitions. [2022-12-06 07:44:09,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 112 transitions, 707 flow [2022-12-06 07:44:09,648 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 07:44:09,649 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 403 flow [2022-12-06 07:44:09,649 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 07:44:09,650 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2022-12-06 07:44:09,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:09,650 INFO L89 Accepts]: Start accepts. Operand has 56 places, 50 transitions, 403 flow [2022-12-06 07:44:09,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:09,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:09,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 50 transitions, 403 flow [2022-12-06 07:44:09,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 403 flow [2022-12-06 07:44:09,661 INFO L130 PetriNetUnfolder]: 34/150 cut-off events. [2022-12-06 07:44:09,661 INFO L131 PetriNetUnfolder]: For 287/296 co-relation queries the response was YES. [2022-12-06 07:44:09,661 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 07:44:09,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 50 transitions, 403 flow [2022-12-06 07:44:09,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-06 07:44:09,669 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 07:44:09,784 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 07:44:09,785 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:09,785 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:10,057 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 07:44:10,236 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 07:44:10,355 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 07:44:10,363 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 07:44:10,733 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 07:44:10,931 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:44:10,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1281 [2022-12-06 07:44:10,932 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 457 flow [2022-12-06 07:44:10,932 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 07:44:10,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:10,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:10,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 07:44:11,132 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 07:44:11,133 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 07:44:11,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:11,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1124682173, now seen corresponding path program 1 times [2022-12-06 07:44:11,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:11,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455334285] [2022-12-06 07:44:11,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:11,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:11,226 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 07:44:11,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:11,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455334285] [2022-12-06 07:44:11,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455334285] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:11,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008562654] [2022-12-06 07:44:11,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:11,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:11,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:11,228 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 07:44:11,230 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 07:44:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:11,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:44:11,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:11,327 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 07:44:11,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:44:11,376 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 07:44:11,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008562654] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:11,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 07:44:11,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2022-12-06 07:44:11,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462978629] [2022-12-06 07:44:11,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:11,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:44:11,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:11,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:44:11,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:44:11,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 07:44:11,378 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 07:44:11,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:11,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 07:44:11,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:11,599 INFO L130 PetriNetUnfolder]: 428/851 cut-off events. [2022-12-06 07:44:11,599 INFO L131 PetriNetUnfolder]: For 3438/3438 co-relation queries the response was YES. [2022-12-06 07:44:11,601 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 07:44:11,604 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 59 selfloop transitions, 23 changer transitions 9/91 dead transitions. [2022-12-06 07:44:11,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 91 transitions, 915 flow [2022-12-06 07:44:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:44:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:44:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 07:44:11,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4148148148148148 [2022-12-06 07:44:11,606 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 457 flow. Second operand 5 states and 56 transitions. [2022-12-06 07:44:11,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 91 transitions, 915 flow [2022-12-06 07:44:11,615 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 07:44:11,617 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 601 flow [2022-12-06 07:44:11,617 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 07:44:11,620 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 40 predicate places. [2022-12-06 07:44:11,620 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:11,620 INFO L89 Accepts]: Start accepts. Operand has 60 places, 60 transitions, 601 flow [2022-12-06 07:44:11,621 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:11,621 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:11,621 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 60 transitions, 601 flow [2022-12-06 07:44:11,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 601 flow [2022-12-06 07:44:11,642 INFO L130 PetriNetUnfolder]: 63/267 cut-off events. [2022-12-06 07:44:11,642 INFO L131 PetriNetUnfolder]: For 708/728 co-relation queries the response was YES. [2022-12-06 07:44:11,643 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 07:44:11,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 60 transitions, 601 flow [2022-12-06 07:44:11,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 07:44:11,648 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 07:44:11,756 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 07:44:11,869 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 07:44:11,938 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:44:11,939 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 319 [2022-12-06 07:44:11,939 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 615 flow [2022-12-06 07:44:11,939 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 07:44:11,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:11,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:11,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 07:44:12,140 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 07:44:12,140 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 07:44:12,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:12,141 INFO L85 PathProgramCache]: Analyzing trace with hash -605884865, now seen corresponding path program 1 times [2022-12-06 07:44:12,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:12,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361244164] [2022-12-06 07:44:12,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:12,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:12,350 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 07:44:12,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:12,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361244164] [2022-12-06 07:44:12,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361244164] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:12,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723642322] [2022-12-06 07:44:12,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:12,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:12,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:12,352 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 07:44:12,354 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 07:44:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:12,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 07:44:12,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:12,506 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 07:44:12,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:44:12,768 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 07:44:12,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723642322] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:44:12,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:44:12,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 07:44:12,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600516879] [2022-12-06 07:44:12,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:44:12,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:44:12,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:12,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:44:12,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:44:12,770 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 07:44:12,770 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 07:44:12,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:12,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 07:44:12,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:13,080 INFO L130 PetriNetUnfolder]: 391/782 cut-off events. [2022-12-06 07:44:13,080 INFO L131 PetriNetUnfolder]: For 3584/3584 co-relation queries the response was YES. [2022-12-06 07:44:13,082 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 07:44:13,084 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 57 selfloop transitions, 23 changer transitions 15/95 dead transitions. [2022-12-06 07:44:13,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 1027 flow [2022-12-06 07:44:13,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:44:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:44:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-12-06 07:44:13,086 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-06 07:44:13,086 INFO L175 Difference]: Start difference. First operand has 57 places, 59 transitions, 615 flow. Second operand 8 states and 63 transitions. [2022-12-06 07:44:13,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 1027 flow [2022-12-06 07:44:13,095 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 07:44:13,098 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 639 flow [2022-12-06 07:44:13,098 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 07:44:13,099 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 44 predicate places. [2022-12-06 07:44:13,099 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:13,099 INFO L89 Accepts]: Start accepts. Operand has 64 places, 59 transitions, 639 flow [2022-12-06 07:44:13,101 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:13,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:13,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 59 transitions, 639 flow [2022-12-06 07:44:13,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 59 transitions, 639 flow [2022-12-06 07:44:13,123 INFO L130 PetriNetUnfolder]: 60/265 cut-off events. [2022-12-06 07:44:13,123 INFO L131 PetriNetUnfolder]: For 747/762 co-relation queries the response was YES. [2022-12-06 07:44:13,123 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 07:44:13,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 59 transitions, 639 flow [2022-12-06 07:44:13,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-06 07:44:13,144 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 07:44:13,245 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 07:44:13,245 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:13,246 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:13,480 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 07:44:13,594 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 07:44:13,594 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:13,594 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:14,025 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 07:44:14,121 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 07:44:14,433 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 07:44:14,544 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 07:44:14,888 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:44:14,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1789 [2022-12-06 07:44:14,889 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 758 flow [2022-12-06 07:44:14,889 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 07:44:14,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:14,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:14,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 07:44:15,089 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 07:44:15,090 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 07:44:15,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1533971526, now seen corresponding path program 1 times [2022-12-06 07:44:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:15,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055692906] [2022-12-06 07:44:15,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:15,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:15,273 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 07:44:15,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:15,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055692906] [2022-12-06 07:44:15,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055692906] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:15,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772613077] [2022-12-06 07:44:15,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:15,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:15,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:15,275 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 07:44:15,313 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 07:44:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:15,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:44:15,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:15,431 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 07:44:15,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:44:15,689 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 07:44:15,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772613077] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:44:15,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:44:15,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 07:44:15,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076271467] [2022-12-06 07:44:15,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:44:15,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:44:15,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:15,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:44:15,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:44:15,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:44:15,691 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 07:44:15,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:15,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:44:15,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:16,263 INFO L130 PetriNetUnfolder]: 452/917 cut-off events. [2022-12-06 07:44:16,263 INFO L131 PetriNetUnfolder]: For 4694/4694 co-relation queries the response was YES. [2022-12-06 07:44:16,265 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 07:44:16,268 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 63 selfloop transitions, 27 changer transitions 25/115 dead transitions. [2022-12-06 07:44:16,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 115 transitions, 1238 flow [2022-12-06 07:44:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:44:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:44:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 81 transitions. [2022-12-06 07:44:16,270 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19285714285714287 [2022-12-06 07:44:16,270 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 758 flow. Second operand 12 states and 81 transitions. [2022-12-06 07:44:16,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 115 transitions, 1238 flow [2022-12-06 07:44:16,285 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 07:44:16,286 INFO L231 Difference]: Finished difference. Result has 77 places, 67 transitions, 776 flow [2022-12-06 07:44:16,287 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 07:44:16,287 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 57 predicate places. [2022-12-06 07:44:16,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:16,288 INFO L89 Accepts]: Start accepts. Operand has 77 places, 67 transitions, 776 flow [2022-12-06 07:44:16,289 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:16,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:16,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 67 transitions, 776 flow [2022-12-06 07:44:16,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 67 transitions, 776 flow [2022-12-06 07:44:16,312 INFO L130 PetriNetUnfolder]: 81/315 cut-off events. [2022-12-06 07:44:16,312 INFO L131 PetriNetUnfolder]: For 2228/2230 co-relation queries the response was YES. [2022-12-06 07:44:16,312 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 07:44:16,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 67 transitions, 776 flow [2022-12-06 07:44:16,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 07:44:16,322 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:16,322 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:16,629 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 07:44:16,807 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 07:44:17,422 WARN L322 ript$VariableManager]: TermVariable LBE115 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:17,422 WARN L322 ript$VariableManager]: TermVariable LBE37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:17,427 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 07:44:17,623 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 07:44:17,623 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 07:44:17,626 INFO L158 Benchmark]: Toolchain (without parser) took 15485.59ms. Allocated memory was 186.6MB in the beginning and 394.3MB in the end (delta: 207.6MB). Free memory was 164.1MB in the beginning and 264.4MB in the end (delta: -100.3MB). Peak memory consumption was 108.5MB. Max. memory is 8.0GB. [2022-12-06 07:44:17,626 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 186.6MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:44:17,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.15ms. Allocated memory is still 186.6MB. Free memory was 163.5MB in the beginning and 152.5MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 07:44:17,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.04ms. Allocated memory is still 186.6MB. Free memory was 152.5MB in the beginning and 151.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:44:17,626 INFO L158 Benchmark]: Boogie Preprocessor took 26.76ms. Allocated memory is still 186.6MB. Free memory was 151.0MB in the beginning and 149.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:44:17,627 INFO L158 Benchmark]: RCFGBuilder took 382.76ms. Allocated memory is still 186.6MB. Free memory was 149.9MB in the beginning and 136.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 07:44:17,627 INFO L158 Benchmark]: TraceAbstraction took 14865.59ms. Allocated memory was 186.6MB in the beginning and 394.3MB in the end (delta: 207.6MB). Free memory was 135.2MB in the beginning and 264.4MB in the end (delta: -129.1MB). Peak memory consumption was 80.2MB. Max. memory is 8.0GB. [2022-12-06 07:44:17,628 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 186.6MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 177.15ms. Allocated memory is still 186.6MB. Free memory was 163.5MB in the beginning and 152.5MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.04ms. Allocated memory is still 186.6MB. Free memory was 152.5MB in the beginning and 151.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.76ms. Allocated memory is still 186.6MB. Free memory was 151.0MB in the beginning and 149.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 382.76ms. Allocated memory is still 186.6MB. Free memory was 149.9MB in the beginning and 136.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 14865.59ms. Allocated memory was 186.6MB in the beginning and 394.3MB in the end (delta: 207.6MB). Free memory was 135.2MB in the beginning and 264.4MB in the end (delta: -129.1MB). Peak memory consumption was 80.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 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: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, 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.3s, 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.8s, 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 07:44:17,667 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...