/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/fibonacci.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:59:27,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:59:27,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:59:27,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:59:27,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:59:27,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:59:27,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:59:27,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:59:27,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:59:27,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:59:27,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:59:27,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:59:27,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:59:27,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:59:27,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:59:27,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:59:27,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:59:27,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:59:27,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:59:27,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:59:27,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:59:27,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:59:27,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:59:27,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:59:27,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:59:27,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:59:27,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:59:27,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:59:27,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:59:27,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:59:27,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:59:27,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:59:27,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:59:27,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:59:27,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:59:27,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:59:27,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:59:27,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:59:27,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:59:27,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:59:27,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:59:27,406 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:59:27,430 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:59:27,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:59:27,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:59:27,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:59:27,432 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:59:27,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:59:27,432 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:59:27,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:59:27,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:59:27,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:59:27,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:59:27,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:59:27,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:59:27,433 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:59:27,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:59:27,434 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:59:27,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:59:27,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:59:27,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:59:27,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:59:27,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:59:27,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:59:27,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:59:27,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:59:27,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:59:27,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:59:27,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:59:27,435 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:59:27,435 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-05 23:59:27,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:59:27,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:59:27,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:59:27,715 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:59:27,715 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:59:27,716 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/fibonacci.wvr.c [2022-12-05 23:59:28,842 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:59:28,978 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:59:28,979 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/fibonacci.wvr.c [2022-12-05 23:59:28,983 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2ab36d83/453bed7a5aef46ecbe5122e3648f7bf8/FLAG75acd9d88 [2022-12-05 23:59:28,993 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2ab36d83/453bed7a5aef46ecbe5122e3648f7bf8 [2022-12-05 23:59:28,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:59:28,995 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:59:28,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:59:28,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:59:28,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:59:28,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:59:28" (1/1) ... [2022-12-05 23:59:28,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f259259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:28, skipping insertion in model container [2022-12-05 23:59:28,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:59:28" (1/1) ... [2022-12-05 23:59:29,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:59:29,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:59:29,149 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/fibonacci.wvr.c[2330,2343] [2022-12-05 23:59:29,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:59:29,168 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:59:29,195 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/fibonacci.wvr.c[2330,2343] [2022-12-05 23:59:29,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:59:29,210 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:59:29,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:29 WrapperNode [2022-12-05 23:59:29,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:59:29,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:59:29,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:59:29,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:59:29,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:29" (1/1) ... [2022-12-05 23:59:29,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:29" (1/1) ... [2022-12-05 23:59:29,254 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 162 [2022-12-05 23:59:29,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:59:29,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:59:29,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:59:29,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:59:29,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:29" (1/1) ... [2022-12-05 23:59:29,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:29" (1/1) ... [2022-12-05 23:59:29,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:29" (1/1) ... [2022-12-05 23:59:29,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:29" (1/1) ... [2022-12-05 23:59:29,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:29" (1/1) ... [2022-12-05 23:59:29,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:29" (1/1) ... [2022-12-05 23:59:29,292 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:29" (1/1) ... [2022-12-05 23:59:29,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:29" (1/1) ... [2022-12-05 23:59:29,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:59:29,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:59:29,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:59:29,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:59:29,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:29" (1/1) ... [2022-12-05 23:59:29,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:59:29,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:59:29,322 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-05 23:59:29,325 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-05 23:59:29,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:59:29,345 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 23:59:29,345 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 23:59:29,346 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 23:59:29,346 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 23:59:29,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:59:29,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:59:29,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:59:29,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:59:29,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:59:29,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:59:29,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:59:29,347 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:59:29,416 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:59:29,417 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:59:29,620 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:59:29,626 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:59:29,626 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-05 23:59:29,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:59:29 BoogieIcfgContainer [2022-12-05 23:59:29,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:59:29,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:59:29,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:59:29,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:59:29,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:59:28" (1/3) ... [2022-12-05 23:59:29,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f270eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:59:29, skipping insertion in model container [2022-12-05 23:59:29,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:29" (2/3) ... [2022-12-05 23:59:29,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f270eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:59:29, skipping insertion in model container [2022-12-05 23:59:29,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:59:29" (3/3) ... [2022-12-05 23:59:29,634 INFO L112 eAbstractionObserver]: Analyzing ICFG fibonacci.wvr.c [2022-12-05 23:59:29,646 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:59:29,647 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 23:59:29,647 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:59:29,751 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 23:59:29,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 189 transitions, 394 flow [2022-12-05 23:59:29,830 INFO L130 PetriNetUnfolder]: 14/187 cut-off events. [2022-12-05 23:59:29,830 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:59:29,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 187 events. 14/187 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 284 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2022-12-05 23:59:29,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 189 transitions, 394 flow [2022-12-05 23:59:29,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 179 transitions, 370 flow [2022-12-05 23:59:29,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:29,854 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 179 transitions, 370 flow [2022-12-05 23:59:29,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 179 transitions, 370 flow [2022-12-05 23:59:29,888 INFO L130 PetriNetUnfolder]: 14/179 cut-off events. [2022-12-05 23:59:29,888 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:59:29,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 179 events. 14/179 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2022-12-05 23:59:29,894 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 179 transitions, 370 flow [2022-12-05 23:59:29,894 INFO L188 LiptonReduction]: Number of co-enabled transitions 7452 [2022-12-05 23:59:36,236 INFO L203 LiptonReduction]: Total number of compositions: 164 [2022-12-05 23:59:36,253 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:59:36,258 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;@320c0f7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:59:36,258 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 23:59:36,283 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-05 23:59:36,283 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:59:36,283 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:36,284 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:36,284 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-05 23:59:36,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:36,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2113518840, now seen corresponding path program 1 times [2022-12-05 23:59:36,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:36,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560614285] [2022-12-05 23:59:36,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:36,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:36,760 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-05 23:59:36,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:36,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560614285] [2022-12-05 23:59:36,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560614285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:36,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:36,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:59:36,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789889750] [2022-12-05 23:59:36,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:36,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:59:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:36,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:59:36,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:59:36,784 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-05 23:59:36,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-05 23:59:36,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:36,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-05 23:59:36,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:36,900 INFO L130 PetriNetUnfolder]: 64/119 cut-off events. [2022-12-05 23:59:36,900 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-05 23:59:36,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 119 events. 64/119 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 334 event pairs, 7 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 181. Up to 85 conditions per place. [2022-12-05 23:59:36,903 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 23 selfloop transitions, 5 changer transitions 5/35 dead transitions. [2022-12-05 23:59:36,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 35 transitions, 166 flow [2022-12-05 23:59:36,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:59:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:59:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-05 23:59:36,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2022-12-05 23:59:36,913 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 5 states and 44 transitions. [2022-12-05 23:59:36,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 35 transitions, 166 flow [2022-12-05 23:59:36,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 35 transitions, 146 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:59:36,919 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 68 flow [2022-12-05 23:59:36,920 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-05 23:59:36,923 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2022-12-05 23:59:36,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:36,924 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 68 flow [2022-12-05 23:59:36,926 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:36,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:36,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 68 flow [2022-12-05 23:59:36,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 68 flow [2022-12-05 23:59:36,934 INFO L130 PetriNetUnfolder]: 8/35 cut-off events. [2022-12-05 23:59:36,935 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:59:36,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 35 events. 8/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 75 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 58. Up to 11 conditions per place. [2022-12-05 23:59:36,937 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 68 flow [2022-12-05 23:59:36,937 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-05 23:59:36,948 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= (ite (< 0 v_~f1_6~0_In_7) 1 0) v_~l_8~0_Out_16) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_6| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_6| 0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_5| v_~n_0~0_In_5))) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_5|, ~f1_6~0=v_~f1_6~0_In_7, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_6|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_6|, ~l_8~0=v_~l_8~0_Out_16, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_5|, ~f1_6~0=v_~f1_6~0_In_7} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-05 23:59:37,315 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:59:37,317 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 394 [2022-12-05 23:59:37,317 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 72 flow [2022-12-05 23:59:37,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-05 23:59:37,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:37,317 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:37,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:59:37,321 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-05 23:59:37,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:37,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1937234240, now seen corresponding path program 2 times [2022-12-05 23:59:37,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:37,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788492842] [2022-12-05 23:59:37,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:37,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:37,505 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-05 23:59:37,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:37,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788492842] [2022-12-05 23:59:37,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788492842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:37,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:37,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:59:37,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818149774] [2022-12-05 23:59:37,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:37,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:59:37,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:37,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:59:37,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:59:37,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-05 23:59:37,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-05 23:59:37,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:37,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-05 23:59:37,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:37,598 INFO L130 PetriNetUnfolder]: 63/111 cut-off events. [2022-12-05 23:59:37,598 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-05 23:59:37,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 111 events. 63/111 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 289 event pairs, 1 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 320. Up to 85 conditions per place. [2022-12-05 23:59:37,599 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 20 selfloop transitions, 6 changer transitions 6/34 dead transitions. [2022-12-05 23:59:37,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 180 flow [2022-12-05 23:59:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:59:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:59:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-05 23:59:37,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-05 23:59:37,600 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 72 flow. Second operand 5 states and 43 transitions. [2022-12-05 23:59:37,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 180 flow [2022-12-05 23:59:37,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 34 transitions, 178 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 23:59:37,601 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 94 flow [2022-12-05 23:59:37,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2022-12-05 23:59:37,602 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 7 predicate places. [2022-12-05 23:59:37,602 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:37,602 INFO L89 Accepts]: Start accepts. Operand has 27 places, 20 transitions, 94 flow [2022-12-05 23:59:37,603 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:37,603 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:37,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 20 transitions, 94 flow [2022-12-05 23:59:37,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 94 flow [2022-12-05 23:59:37,607 INFO L130 PetriNetUnfolder]: 10/34 cut-off events. [2022-12-05 23:59:37,607 INFO L131 PetriNetUnfolder]: For 12/14 co-relation queries the response was YES. [2022-12-05 23:59:37,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 34 events. 10/34 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 61 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 74. Up to 13 conditions per place. [2022-12-05 23:59:37,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 94 flow [2022-12-05 23:59:37,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-05 23:59:37,608 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:59:37,608 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-05 23:59:37,608 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 94 flow [2022-12-05 23:59:37,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-05 23:59:37,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:37,609 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:37,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:59:37,609 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-05 23:59:37,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:37,609 INFO L85 PathProgramCache]: Analyzing trace with hash -50351282, now seen corresponding path program 1 times [2022-12-05 23:59:37,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:37,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826698812] [2022-12-05 23:59:37,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:37,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:37,643 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-05 23:59:37,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:37,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826698812] [2022-12-05 23:59:37,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826698812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:37,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:37,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:59:37,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583660362] [2022-12-05 23:59:37,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:37,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:59:37,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:37,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:59:37,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:59:37,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-05 23:59:37,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 23:59:37,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:37,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-05 23:59:37,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:37,694 INFO L130 PetriNetUnfolder]: 89/160 cut-off events. [2022-12-05 23:59:37,694 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-05 23:59:37,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 160 events. 89/160 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 445 event pairs, 26 based on Foata normal form. 2/148 useless extension candidates. Maximal degree in co-relation 504. Up to 102 conditions per place. [2022-12-05 23:59:37,696 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 31 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2022-12-05 23:59:37,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 39 transitions, 258 flow [2022-12-05 23:59:37,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:59:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:59:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-05 23:59:37,697 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.515625 [2022-12-05 23:59:37,697 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 94 flow. Second operand 4 states and 33 transitions. [2022-12-05 23:59:37,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 39 transitions, 258 flow [2022-12-05 23:59:37,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 39 transitions, 224 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-05 23:59:37,698 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 133 flow [2022-12-05 23:59:37,698 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2022-12-05 23:59:37,699 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2022-12-05 23:59:37,699 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:37,699 INFO L89 Accepts]: Start accepts. Operand has 26 places, 25 transitions, 133 flow [2022-12-05 23:59:37,699 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:37,699 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:37,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 25 transitions, 133 flow [2022-12-05 23:59:37,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 25 transitions, 133 flow [2022-12-05 23:59:37,704 INFO L130 PetriNetUnfolder]: 15/52 cut-off events. [2022-12-05 23:59:37,704 INFO L131 PetriNetUnfolder]: For 10/13 co-relation queries the response was YES. [2022-12-05 23:59:37,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 52 events. 15/52 cut-off events. For 10/13 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 105. Up to 19 conditions per place. [2022-12-05 23:59:37,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 25 transitions, 133 flow [2022-12-05 23:59:37,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-05 23:59:37,859 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] $Ultimate##0-->L44-5: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-05 23:59:38,011 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:59:38,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 313 [2022-12-05 23:59:38,012 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 137 flow [2022-12-05 23:59:38,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 23:59:38,013 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:38,013 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:38,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:59:38,013 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-05 23:59:38,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:38,013 INFO L85 PathProgramCache]: Analyzing trace with hash 223640520, now seen corresponding path program 2 times [2022-12-05 23:59:38,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:38,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864923691] [2022-12-05 23:59:38,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:38,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:38,057 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-05 23:59:38,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:38,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864923691] [2022-12-05 23:59:38,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864923691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:38,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:38,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:59:38,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514949895] [2022-12-05 23:59:38,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:38,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:59:38,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:38,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:59:38,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:59:38,078 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:59:38,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 23:59:38,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:38,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:59:38,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:38,134 INFO L130 PetriNetUnfolder]: 103/188 cut-off events. [2022-12-05 23:59:38,136 INFO L131 PetriNetUnfolder]: For 154/154 co-relation queries the response was YES. [2022-12-05 23:59:38,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 188 events. 103/188 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 570 event pairs, 29 based on Foata normal form. 2/190 useless extension candidates. Maximal degree in co-relation 183. Up to 111 conditions per place. [2022-12-05 23:59:38,141 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 33 selfloop transitions, 9 changer transitions 0/42 dead transitions. [2022-12-05 23:59:38,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 42 transitions, 280 flow [2022-12-05 23:59:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:59:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:59:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-05 23:59:38,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:59:38,143 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 137 flow. Second operand 4 states and 36 transitions. [2022-12-05 23:59:38,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 42 transitions, 280 flow [2022-12-05 23:59:38,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 42 transitions, 266 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-05 23:59:38,146 INFO L231 Difference]: Finished difference. Result has 30 places, 28 transitions, 175 flow [2022-12-05 23:59:38,146 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=30, PETRI_TRANSITIONS=28} [2022-12-05 23:59:38,147 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2022-12-05 23:59:38,147 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:38,147 INFO L89 Accepts]: Start accepts. Operand has 30 places, 28 transitions, 175 flow [2022-12-05 23:59:38,148 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:38,148 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:38,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 28 transitions, 175 flow [2022-12-05 23:59:38,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 175 flow [2022-12-05 23:59:38,152 INFO L130 PetriNetUnfolder]: 12/53 cut-off events. [2022-12-05 23:59:38,152 INFO L131 PetriNetUnfolder]: For 23/25 co-relation queries the response was YES. [2022-12-05 23:59:38,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 53 events. 12/53 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 157 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 110. Up to 15 conditions per place. [2022-12-05 23:59:38,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 28 transitions, 175 flow [2022-12-05 23:59:38,153 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-05 23:59:38,178 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] $Ultimate##0-->L54-5: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-05 23:59:38,829 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:59:38,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 688 [2022-12-05 23:59:38,835 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 173 flow [2022-12-05 23:59:38,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 23:59:38,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:38,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:38,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:59:38,835 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-05 23:59:38,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:38,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1973876871, now seen corresponding path program 1 times [2022-12-05 23:59:38,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:38,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689590498] [2022-12-05 23:59:38,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:38,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:38,883 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-05 23:59:38,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:38,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689590498] [2022-12-05 23:59:38,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689590498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:38,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:38,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:59:38,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726376126] [2022-12-05 23:59:38,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:38,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:59:38,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:38,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:59:38,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:59:38,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:59:38,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-05 23:59:38,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:38,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:59:38,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:38,966 INFO L130 PetriNetUnfolder]: 113/204 cut-off events. [2022-12-05 23:59:38,966 INFO L131 PetriNetUnfolder]: For 291/291 co-relation queries the response was YES. [2022-12-05 23:59:38,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 204 events. 113/204 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 616 event pairs, 36 based on Foata normal form. 12/216 useless extension candidates. Maximal degree in co-relation 469. Up to 144 conditions per place. [2022-12-05 23:59:38,967 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 38 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2022-12-05 23:59:38,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 48 transitions, 346 flow [2022-12-05 23:59:38,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:59:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:59:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-05 23:59:38,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-05 23:59:38,968 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 173 flow. Second operand 5 states and 44 transitions. [2022-12-05 23:59:38,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 48 transitions, 346 flow [2022-12-05 23:59:38,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 48 transitions, 328 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-05 23:59:38,970 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 204 flow [2022-12-05 23:59:38,970 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2022-12-05 23:59:38,970 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 13 predicate places. [2022-12-05 23:59:38,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:38,970 INFO L89 Accepts]: Start accepts. Operand has 33 places, 30 transitions, 204 flow [2022-12-05 23:59:38,971 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:38,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:38,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 30 transitions, 204 flow [2022-12-05 23:59:38,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 204 flow [2022-12-05 23:59:38,976 INFO L130 PetriNetUnfolder]: 18/69 cut-off events. [2022-12-05 23:59:38,977 INFO L131 PetriNetUnfolder]: For 44/47 co-relation queries the response was YES. [2022-12-05 23:59:38,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 69 events. 18/69 cut-off events. For 44/47 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 237 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 161. Up to 19 conditions per place. [2022-12-05 23:59:38,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 30 transitions, 204 flow [2022-12-05 23:59:38,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-05 23:59:39,041 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L44-5: Formula: (and (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_61| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_61| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_61| 2147483648))) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_55| (+ v_~n_0~0_75 1)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_61| |v_thread1Thread1of1ForFork0_minus_#in~a#1_27|) (= |v_thread1Thread1of1ForFork0_~i~0#1_55| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_135|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_29| v_~f2_3~0_90) (= v_~f1_2~0_100 |v_thread1Thread1of1ForFork0_plus_#res#1_45|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_61| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_31| v_~f2_3~0_90) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_43| 2147483647) (= v_~f1_2~0_101 |v_thread1Thread1of1ForFork0_plus_#in~a#1_31|) (= v_~f2_3~0_89 |v_thread1Thread1of1ForFork0_minus_#res#1_43|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_45| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_49| |v_thread1Thread1of1ForFork0_plus_~b#1_49|)) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_31| |v_thread1Thread1of1ForFork0_plus_~a#1_49|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_43|) |v_thread1Thread1of1ForFork0_minus_~a#1_61|) (= v_~f1_2~0_100 |v_thread1Thread1of1ForFork0_minus_#in~a#1_27|) (<= v_~f1_2~0_100 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_31| |v_thread1Thread1of1ForFork0_plus_~b#1_49|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_29|) (<= 0 (+ v_~f1_2~0_100 2147483648))) InVars {~f1_2~0=v_~f1_2~0_101, ~f2_3~0=v_~f2_3~0_90, ~n_0~0=v_~n_0~0_75} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_43|, ~f2_3~0=v_~f2_3~0_89, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_49|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_27|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_45|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_49|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_31|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|, ~f1_2~0=v_~f1_2~0_100, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_27|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, ~n_0~0=v_~n_0~0_75, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_37|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_61|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_135|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_45|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_31|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-05 23:59:40,102 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:59:40,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1133 [2022-12-05 23:59:40,103 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 214 flow [2022-12-05 23:59:40,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-05 23:59:40,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:40,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:40,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:59:40,103 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-05 23:59:40,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1540809514, now seen corresponding path program 1 times [2022-12-05 23:59:40,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:40,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309883432] [2022-12-05 23:59:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:40,129 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-05 23:59:40,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:40,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309883432] [2022-12-05 23:59:40,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309883432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:40,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:40,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:59:40,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090649457] [2022-12-05 23:59:40,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:40,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:59:40,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:40,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:59:40,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:59:40,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-05 23:59:40,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 214 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-05 23:59:40,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:40,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-05 23:59:40,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:40,195 INFO L130 PetriNetUnfolder]: 99/189 cut-off events. [2022-12-05 23:59:40,196 INFO L131 PetriNetUnfolder]: For 406/410 co-relation queries the response was YES. [2022-12-05 23:59:40,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 189 events. 99/189 cut-off events. For 406/410 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 644 event pairs, 28 based on Foata normal form. 4/193 useless extension candidates. Maximal degree in co-relation 483. Up to 126 conditions per place. [2022-12-05 23:59:40,197 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 32 selfloop transitions, 8 changer transitions 3/44 dead transitions. [2022-12-05 23:59:40,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 351 flow [2022-12-05 23:59:40,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:59:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:59:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-05 23:59:40,198 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-05 23:59:40,198 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 214 flow. Second operand 4 states and 41 transitions. [2022-12-05 23:59:40,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 351 flow [2022-12-05 23:59:40,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 335 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 23:59:40,199 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 212 flow [2022-12-05 23:59:40,199 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=4, PETRI_FLOW=212, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-05 23:59:40,200 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 16 predicate places. [2022-12-05 23:59:40,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:40,200 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 212 flow [2022-12-05 23:59:40,200 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:40,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:40,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 212 flow [2022-12-05 23:59:40,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 212 flow [2022-12-05 23:59:40,206 INFO L130 PetriNetUnfolder]: 16/61 cut-off events. [2022-12-05 23:59:40,206 INFO L131 PetriNetUnfolder]: For 63/66 co-relation queries the response was YES. [2022-12-05 23:59:40,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 61 events. 16/61 cut-off events. For 63/66 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 198 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 160. Up to 17 conditions per place. [2022-12-05 23:59:40,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 212 flow [2022-12-05 23:59:40,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-05 23:59:40,207 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:59:40,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-05 23:59:40,207 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 212 flow [2022-12-05 23:59:40,207 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-05 23:59:40,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:40,207 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:40,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:59:40,208 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-05 23:59:40,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:40,208 INFO L85 PathProgramCache]: Analyzing trace with hash 728490509, now seen corresponding path program 1 times [2022-12-05 23:59:40,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:40,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413355912] [2022-12-05 23:59:40,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:40,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:40,270 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-05 23:59:40,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:40,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413355912] [2022-12-05 23:59:40,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413355912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:40,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:40,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:59:40,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607268089] [2022-12-05 23:59:40,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:40,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:59:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:40,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:59:40,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:59:40,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:59:40,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 23:59:40,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:40,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:59:40,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:40,342 INFO L130 PetriNetUnfolder]: 111/202 cut-off events. [2022-12-05 23:59:40,342 INFO L131 PetriNetUnfolder]: For 406/406 co-relation queries the response was YES. [2022-12-05 23:59:40,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 202 events. 111/202 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 624 event pairs, 35 based on Foata normal form. 6/208 useless extension candidates. Maximal degree in co-relation 561. Up to 131 conditions per place. [2022-12-05 23:59:40,343 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 37 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2022-12-05 23:59:40,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 359 flow [2022-12-05 23:59:40,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:59:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:59:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-05 23:59:40,345 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-05 23:59:40,345 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 212 flow. Second operand 4 states and 38 transitions. [2022-12-05 23:59:40,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 359 flow [2022-12-05 23:59:40,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 347 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-05 23:59:40,346 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 227 flow [2022-12-05 23:59:40,347 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2022-12-05 23:59:40,347 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 18 predicate places. [2022-12-05 23:59:40,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:40,347 INFO L89 Accepts]: Start accepts. Operand has 38 places, 30 transitions, 227 flow [2022-12-05 23:59:40,347 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:40,348 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:40,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 227 flow [2022-12-05 23:59:40,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 227 flow [2022-12-05 23:59:40,353 INFO L130 PetriNetUnfolder]: 17/63 cut-off events. [2022-12-05 23:59:40,353 INFO L131 PetriNetUnfolder]: For 86/89 co-relation queries the response was YES. [2022-12-05 23:59:40,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 63 events. 17/63 cut-off events. For 86/89 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 210 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 175. Up to 18 conditions per place. [2022-12-05 23:59:40,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 227 flow [2022-12-05 23:59:40,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-05 23:59:40,354 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:59:40,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-05 23:59:40,355 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 227 flow [2022-12-05 23:59:40,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 23:59:40,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:40,355 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:40,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:59:40,356 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-05 23:59:40,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:40,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1689563611, now seen corresponding path program 1 times [2022-12-05 23:59:40,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:40,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906416252] [2022-12-05 23:59:40,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:40,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:40,390 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-05 23:59:40,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:40,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906416252] [2022-12-05 23:59:40,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906416252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:40,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:40,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:59:40,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316967309] [2022-12-05 23:59:40,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:40,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:59:40,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:40,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:59:40,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:59:40,391 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:59:40,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 227 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-05 23:59:40,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:40,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:59:40,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:40,445 INFO L130 PetriNetUnfolder]: 118/211 cut-off events. [2022-12-05 23:59:40,446 INFO L131 PetriNetUnfolder]: For 675/679 co-relation queries the response was YES. [2022-12-05 23:59:40,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 211 events. 118/211 cut-off events. For 675/679 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 695 event pairs, 30 based on Foata normal form. 8/211 useless extension candidates. Maximal degree in co-relation 584. Up to 142 conditions per place. [2022-12-05 23:59:40,447 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 34 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2022-12-05 23:59:40,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 370 flow [2022-12-05 23:59:40,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:59:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:59:40,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-05 23:59:40,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4875 [2022-12-05 23:59:40,448 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 227 flow. Second operand 4 states and 39 transitions. [2022-12-05 23:59:40,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 370 flow [2022-12-05 23:59:40,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 352 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-05 23:59:40,450 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 237 flow [2022-12-05 23:59:40,450 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2022-12-05 23:59:40,452 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 20 predicate places. [2022-12-05 23:59:40,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:40,452 INFO L89 Accepts]: Start accepts. Operand has 40 places, 31 transitions, 237 flow [2022-12-05 23:59:40,453 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:40,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:40,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 237 flow [2022-12-05 23:59:40,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 237 flow [2022-12-05 23:59:40,459 INFO L130 PetriNetUnfolder]: 18/66 cut-off events. [2022-12-05 23:59:40,459 INFO L131 PetriNetUnfolder]: For 94/97 co-relation queries the response was YES. [2022-12-05 23:59:40,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 66 events. 18/66 cut-off events. For 94/97 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 218 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 188. Up to 19 conditions per place. [2022-12-05 23:59:40,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 237 flow [2022-12-05 23:59:40,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-05 23:59:40,460 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:59:40,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-05 23:59:40,461 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 237 flow [2022-12-05 23:59:40,462 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-05 23:59:40,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:40,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:40,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:59:40,462 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-05 23:59:40,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:40,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1451306272, now seen corresponding path program 1 times [2022-12-05 23:59:40,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:40,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031219010] [2022-12-05 23:59:40,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:40,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:40,752 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-05 23:59:40,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:40,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031219010] [2022-12-05 23:59:40,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031219010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:40,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:40,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:59:40,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238204127] [2022-12-05 23:59:40,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:40,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:59:40,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:40,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:59:40,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:59:40,753 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:59:40,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-05 23:59:40,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:40,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:59:40,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:40,887 INFO L130 PetriNetUnfolder]: 119/224 cut-off events. [2022-12-05 23:59:40,888 INFO L131 PetriNetUnfolder]: For 602/611 co-relation queries the response was YES. [2022-12-05 23:59:40,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 224 events. 119/224 cut-off events. For 602/611 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 797 event pairs, 14 based on Foata normal form. 5/222 useless extension candidates. Maximal degree in co-relation 673. Up to 173 conditions per place. [2022-12-05 23:59:40,889 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 31 selfloop transitions, 14 changer transitions 7/55 dead transitions. [2022-12-05 23:59:40,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 430 flow [2022-12-05 23:59:40,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:59:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:59:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-12-05 23:59:40,890 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2022-12-05 23:59:40,890 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 237 flow. Second operand 7 states and 61 transitions. [2022-12-05 23:59:40,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 430 flow [2022-12-05 23:59:40,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 412 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-05 23:59:40,893 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 289 flow [2022-12-05 23:59:40,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=289, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2022-12-05 23:59:40,894 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 27 predicate places. [2022-12-05 23:59:40,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:40,894 INFO L89 Accepts]: Start accepts. Operand has 47 places, 35 transitions, 289 flow [2022-12-05 23:59:40,895 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:40,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:40,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 289 flow [2022-12-05 23:59:40,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 289 flow [2022-12-05 23:59:40,903 INFO L130 PetriNetUnfolder]: 21/82 cut-off events. [2022-12-05 23:59:40,903 INFO L131 PetriNetUnfolder]: For 158/163 co-relation queries the response was YES. [2022-12-05 23:59:40,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 82 events. 21/82 cut-off events. For 158/163 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 316 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 279. Up to 20 conditions per place. [2022-12-05 23:59:40,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 35 transitions, 289 flow [2022-12-05 23:59:40,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-05 23:59:41,958 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (= (ite (< 0 v_~f1_2~0_In_8) 1 0) v_~l_4~0_Out_16) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~n_0~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~f1_2~0=v_~f1_2~0_In_8, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{~f1_2~0=v_~f1_2~0_In_8, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, ~l_4~0=v_~l_4~0_Out_16, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-05 23:59:42,208 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:59:42,209 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1315 [2022-12-05 23:59:42,209 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 303 flow [2022-12-05 23:59:42,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-05 23:59:42,209 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:42,209 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:42,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:59:42,209 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-05 23:59:42,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:42,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1350469854, now seen corresponding path program 1 times [2022-12-05 23:59:42,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:42,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028606647] [2022-12-05 23:59:42,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:42,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:42,251 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-05 23:59:42,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:42,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028606647] [2022-12-05 23:59:42,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028606647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:42,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:42,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:59:42,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794942529] [2022-12-05 23:59:42,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:42,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:59:42,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:42,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:59:42,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:59:42,252 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-05 23:59:42,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 23:59:42,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:42,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-05 23:59:42,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:42,313 INFO L130 PetriNetUnfolder]: 133/246 cut-off events. [2022-12-05 23:59:42,313 INFO L131 PetriNetUnfolder]: For 766/766 co-relation queries the response was YES. [2022-12-05 23:59:42,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 246 events. 133/246 cut-off events. For 766/766 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 852 event pairs, 38 based on Foata normal form. 4/248 useless extension candidates. Maximal degree in co-relation 1130. Up to 178 conditions per place. [2022-12-05 23:59:42,315 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 36 selfloop transitions, 11 changer transitions 1/48 dead transitions. [2022-12-05 23:59:42,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 481 flow [2022-12-05 23:59:42,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:59:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:59:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-05 23:59:42,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2022-12-05 23:59:42,315 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 303 flow. Second operand 4 states and 37 transitions. [2022-12-05 23:59:42,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 481 flow [2022-12-05 23:59:42,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 445 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-05 23:59:42,318 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 305 flow [2022-12-05 23:59:42,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=305, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2022-12-05 23:59:42,318 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 27 predicate places. [2022-12-05 23:59:42,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:42,318 INFO L89 Accepts]: Start accepts. Operand has 47 places, 36 transitions, 305 flow [2022-12-05 23:59:42,319 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:42,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:42,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 36 transitions, 305 flow [2022-12-05 23:59:42,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 36 transitions, 305 flow [2022-12-05 23:59:42,326 INFO L130 PetriNetUnfolder]: 22/81 cut-off events. [2022-12-05 23:59:42,326 INFO L131 PetriNetUnfolder]: For 147/154 co-relation queries the response was YES. [2022-12-05 23:59:42,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 81 events. 22/81 cut-off events. For 147/154 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 309 event pairs, 0 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 263. Up to 23 conditions per place. [2022-12-05 23:59:42,327 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 36 transitions, 305 flow [2022-12-05 23:59:42,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-05 23:59:42,327 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [770] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_35| v_~f2_3~0_98) (= v_~f1_6~0_104 |v_thread2Thread1of1ForFork1_minus_#in~a#1_41|) (= v_~f2_7~0_112 |v_thread2Thread1of1ForFork1_plus_#in~b#1_33|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_39| 2147483648)) (= v_~f1_2~0_108 |v_thread1Thread1of1ForFork0_plus_#res#1_49|) (<= 0 (+ v_~f1_2~0_108 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_63| |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_35| |v_thread1Thread1of1ForFork0_plus_~b#1_53|) (<= 0 (+ v_~f2_7~0_111 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_65| |v_thread1Thread1of1ForFork0_minus_#in~a#1_31|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_39| v_~f1_6~0_104) (<= v_~f1_2~0_108 2147483647) (= |v_thread1Thread1of1ForFork0_~i~0#1_65| 1) (= |v_thread2Thread1of1ForFork1_plus_#res#1_39| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_57| |v_thread2Thread1of1ForFork1_plus_~b#1_59|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_65| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_65| 2147483648)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_65| 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_65|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_65| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_65|))) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_63| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_63| |v_thread2Thread1of1ForFork1_minus_#res#1_47|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_49| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_53| |v_thread1Thread1of1ForFork0_plus_~b#1_53|)) (< |v_thread2Thread1of1ForFork1_~i~1#1_68| v_~n_0~0_85) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_35| |v_thread1Thread1of1ForFork0_plus_~a#1_53|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_47| 2147483647) (= v_~f1_2~0_109 |v_thread1Thread1of1ForFork0_plus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_59| |v_thread2Thread1of1ForFork1_plus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_63| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_63|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_63|)) 1 0)) (= v_~f1_6~0_105 |v_thread2Thread1of1ForFork1_plus_#in~a#1_29|) (= v_~f1_2~0_108 |v_thread1Thread1of1ForFork0_minus_#in~a#1_31|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_65| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_65| |v_thread1Thread1of1ForFork0_minus_#res#1_47|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_63| |v_thread2Thread1of1ForFork1_minus_#in~a#1_41|) (= v_~f2_7~0_111 |v_thread2Thread1of1ForFork1_minus_#res#1_47|) (= v_~f2_3~0_97 |v_thread1Thread1of1ForFork0_minus_#res#1_47|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_65| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|) (<= v_~f2_7~0_111 2147483647) (= v_~f2_7~0_112 |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_39| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| v_~f2_3~0_98) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_68|) |v_thread2Thread1of1ForFork1_~i~1#1_67|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|) (< |v_thread1Thread1of1ForFork0_~i~0#1_65| (+ v_~n_0~0_85 1)) (= |v_thread2Thread1of1ForFork1_plus_~a#1_57| |v_thread2Thread1of1ForFork1_plus_#in~a#1_29|)) InVars {~f1_2~0=v_~f1_2~0_109, ~f2_3~0=v_~f2_3~0_98, ~n_0~0=v_~n_0~0_85, ~f2_7~0=v_~f2_7~0_112, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_68|, ~f1_6~0=v_~f1_6~0_105} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_33|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_31|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_57|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_35|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_67|, ~f1_6~0=v_~f1_6~0_104, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_41|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_63|, ~f1_2~0=v_~f1_2~0_108, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_41|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_39|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_59|, ~n_0~0=v_~n_0~0_85, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_41|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_41|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_47|, ~f2_3~0=v_~f2_3~0_97, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_53|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_63|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_53|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_65|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_65|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_65|, ~f2_7~0=v_~f2_7~0_111, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_49|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_35|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [775] L44-5-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_#res#1_45| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_63| |v_thread2Thread1of1ForFork1_plus_~b#1_65|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_69| |v_thread2Thread1of1ForFork1_minus_#in~b#1_47|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_13| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_69| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_69|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_69|)) 1 0)) (= (ite (< 0 v_~f1_2~0_122) 1 0) v_~l_4~0_61) (= |v_thread1Thread1of1ForFork0_#res#1.base_13| 0) (<= v_~f2_7~0_121 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_45| 2147483647) (= v_~f1_6~0_115 |v_thread2Thread1of1ForFork1_plus_#in~a#1_35|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_45| 2147483648)) (= v_~f1_6~0_114 |v_thread2Thread1of1ForFork1_minus_#in~a#1_47|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_65| |v_thread2Thread1of1ForFork1_plus_#in~b#1_39|) (< |v_thread2Thread1of1ForFork1_~i~1#1_78| v_~n_0~0_91) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_78|) |v_thread2Thread1of1ForFork1_~i~1#1_77|) (<= 0 (+ v_~f2_7~0_121 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_69| |v_thread2Thread1of1ForFork1_minus_#in~a#1_47|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_69| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_69| |v_thread2Thread1of1ForFork1_minus_#res#1_53|)) (= v_~f2_7~0_121 |v_thread2Thread1of1ForFork1_minus_#res#1_53|) (= v_~f2_7~0_122 |v_thread2Thread1of1ForFork1_plus_#in~b#1_39|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_63| |v_thread2Thread1of1ForFork1_plus_#in~a#1_35|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_73| v_~n_0~0_91)) (= v_~f2_7~0_122 |v_thread2Thread1of1ForFork1_minus_#in~b#1_47|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_45| v_~f1_6~0_114)) InVars {~f1_2~0=v_~f1_2~0_122, ~n_0~0=v_~n_0~0_91, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_73|, ~f2_7~0=v_~f2_7~0_122, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_78|, ~f1_6~0=v_~f1_6~0_115} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_35|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_39|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_13|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_69|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_63|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_77|, ~f1_6~0=v_~f1_6~0_114, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_47|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|, ~f1_2~0=v_~f1_2~0_122, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_47|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_45|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_65|, ~n_0~0=v_~n_0~0_91, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_73|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_47|, ~f2_7~0=v_~f2_7~0_121, ~l_4~0=v_~l_4~0_61, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_47|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, ~l_4~0, thread2Thread1of1ForFork1_#t~ret6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-05 23:59:43,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:59:43,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1309 [2022-12-05 23:59:43,627 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 312 flow [2022-12-05 23:59:43,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 23:59:43,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:43,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:43,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:59:43,627 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:59:43,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:43,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1371475408, now seen corresponding path program 1 times [2022-12-05 23:59:43,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:43,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119347886] [2022-12-05 23:59:43,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:43,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:43,660 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-05 23:59:43,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:43,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119347886] [2022-12-05 23:59:43,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119347886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:43,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:43,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:59:43,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310278167] [2022-12-05 23:59:43,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:43,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:59:43,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:43,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:59:43,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:59:43,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-05 23:59:43,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 23:59:43,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:43,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-05 23:59:43,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:43,739 INFO L130 PetriNetUnfolder]: 137/254 cut-off events. [2022-12-05 23:59:43,739 INFO L131 PetriNetUnfolder]: For 901/901 co-relation queries the response was YES. [2022-12-05 23:59:43,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 254 events. 137/254 cut-off events. For 901/901 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 894 event pairs, 38 based on Foata normal form. 6/260 useless extension candidates. Maximal degree in co-relation 1045. Up to 178 conditions per place. [2022-12-05 23:59:43,740 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 35 selfloop transitions, 12 changer transitions 1/48 dead transitions. [2022-12-05 23:59:43,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 472 flow [2022-12-05 23:59:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:59:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:59:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-05 23:59:43,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2022-12-05 23:59:43,741 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 312 flow. Second operand 4 states and 37 transitions. [2022-12-05 23:59:43,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 472 flow [2022-12-05 23:59:43,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 450 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 23:59:43,744 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 314 flow [2022-12-05 23:59:43,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2022-12-05 23:59:43,745 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 29 predicate places. [2022-12-05 23:59:43,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:43,745 INFO L89 Accepts]: Start accepts. Operand has 49 places, 36 transitions, 314 flow [2022-12-05 23:59:43,745 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:43,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:43,745 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 36 transitions, 314 flow [2022-12-05 23:59:43,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 36 transitions, 314 flow [2022-12-05 23:59:43,752 INFO L130 PetriNetUnfolder]: 22/80 cut-off events. [2022-12-05 23:59:43,753 INFO L131 PetriNetUnfolder]: For 205/215 co-relation queries the response was YES. [2022-12-05 23:59:43,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 80 events. 22/80 cut-off events. For 205/215 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 297 event pairs, 0 based on Foata normal form. 1/81 useless extension candidates. Maximal degree in co-relation 280. Up to 24 conditions per place. [2022-12-05 23:59:43,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 36 transitions, 314 flow [2022-12-05 23:59:43,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-05 23:59:43,754 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:59:43,754 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-05 23:59:43,754 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 314 flow [2022-12-05 23:59:43,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 23:59:43,754 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:43,754 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:43,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:59:43,754 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:59:43,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:43,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1368189382, now seen corresponding path program 2 times [2022-12-05 23:59:43,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:43,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872371175] [2022-12-05 23:59:43,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:43,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:43,988 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-05 23:59:43,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:43,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872371175] [2022-12-05 23:59:43,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872371175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:43,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:43,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:59:43,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491256787] [2022-12-05 23:59:43,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:43,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:59:43,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:43,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:59:43,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:59:43,990 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:59:43,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-05 23:59:43,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:43,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:59:43,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:44,110 INFO L130 PetriNetUnfolder]: 122/227 cut-off events. [2022-12-05 23:59:44,110 INFO L131 PetriNetUnfolder]: For 985/998 co-relation queries the response was YES. [2022-12-05 23:59:44,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1139 conditions, 227 events. 122/227 cut-off events. For 985/998 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 827 event pairs, 20 based on Foata normal form. 9/228 useless extension candidates. Maximal degree in co-relation 968. Up to 185 conditions per place. [2022-12-05 23:59:44,112 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 28 selfloop transitions, 13 changer transitions 8/52 dead transitions. [2022-12-05 23:59:44,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 466 flow [2022-12-05 23:59:44,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:59:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:59:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-12-05 23:59:44,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2022-12-05 23:59:44,113 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 314 flow. Second operand 6 states and 53 transitions. [2022-12-05 23:59:44,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 466 flow [2022-12-05 23:59:44,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 440 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-05 23:59:44,115 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 332 flow [2022-12-05 23:59:44,115 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2022-12-05 23:59:44,116 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 34 predicate places. [2022-12-05 23:59:44,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:44,116 INFO L89 Accepts]: Start accepts. Operand has 54 places, 37 transitions, 332 flow [2022-12-05 23:59:44,117 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:44,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:44,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 37 transitions, 332 flow [2022-12-05 23:59:44,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 37 transitions, 332 flow [2022-12-05 23:59:44,124 INFO L130 PetriNetUnfolder]: 22/72 cut-off events. [2022-12-05 23:59:44,124 INFO L131 PetriNetUnfolder]: For 238/248 co-relation queries the response was YES. [2022-12-05 23:59:44,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 72 events. 22/72 cut-off events. For 238/248 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 242 event pairs, 0 based on Foata normal form. 1/73 useless extension candidates. Maximal degree in co-relation 298. Up to 24 conditions per place. [2022-12-05 23:59:44,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 37 transitions, 332 flow [2022-12-05 23:59:44,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-05 23:59:44,792 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [770] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_35| v_~f2_3~0_98) (= v_~f1_6~0_104 |v_thread2Thread1of1ForFork1_minus_#in~a#1_41|) (= v_~f2_7~0_112 |v_thread2Thread1of1ForFork1_plus_#in~b#1_33|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_39| 2147483648)) (= v_~f1_2~0_108 |v_thread1Thread1of1ForFork0_plus_#res#1_49|) (<= 0 (+ v_~f1_2~0_108 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_63| |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_35| |v_thread1Thread1of1ForFork0_plus_~b#1_53|) (<= 0 (+ v_~f2_7~0_111 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_65| |v_thread1Thread1of1ForFork0_minus_#in~a#1_31|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_39| v_~f1_6~0_104) (<= v_~f1_2~0_108 2147483647) (= |v_thread1Thread1of1ForFork0_~i~0#1_65| 1) (= |v_thread2Thread1of1ForFork1_plus_#res#1_39| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_57| |v_thread2Thread1of1ForFork1_plus_~b#1_59|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_65| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_65| 2147483648)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_65| 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_65|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_65| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_65|))) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_63| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_63| |v_thread2Thread1of1ForFork1_minus_#res#1_47|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_49| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_53| |v_thread1Thread1of1ForFork0_plus_~b#1_53|)) (< |v_thread2Thread1of1ForFork1_~i~1#1_68| v_~n_0~0_85) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_35| |v_thread1Thread1of1ForFork0_plus_~a#1_53|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_47| 2147483647) (= v_~f1_2~0_109 |v_thread1Thread1of1ForFork0_plus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_59| |v_thread2Thread1of1ForFork1_plus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_63| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_63|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_63|)) 1 0)) (= v_~f1_6~0_105 |v_thread2Thread1of1ForFork1_plus_#in~a#1_29|) (= v_~f1_2~0_108 |v_thread1Thread1of1ForFork0_minus_#in~a#1_31|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_65| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_65| |v_thread1Thread1of1ForFork0_minus_#res#1_47|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_63| |v_thread2Thread1of1ForFork1_minus_#in~a#1_41|) (= v_~f2_7~0_111 |v_thread2Thread1of1ForFork1_minus_#res#1_47|) (= v_~f2_3~0_97 |v_thread1Thread1of1ForFork0_minus_#res#1_47|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_65| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|) (<= v_~f2_7~0_111 2147483647) (= v_~f2_7~0_112 |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_39| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| v_~f2_3~0_98) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_68|) |v_thread2Thread1of1ForFork1_~i~1#1_67|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|) (< |v_thread1Thread1of1ForFork0_~i~0#1_65| (+ v_~n_0~0_85 1)) (= |v_thread2Thread1of1ForFork1_plus_~a#1_57| |v_thread2Thread1of1ForFork1_plus_#in~a#1_29|)) InVars {~f1_2~0=v_~f1_2~0_109, ~f2_3~0=v_~f2_3~0_98, ~n_0~0=v_~n_0~0_85, ~f2_7~0=v_~f2_7~0_112, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_68|, ~f1_6~0=v_~f1_6~0_105} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_33|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_31|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_57|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_35|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_67|, ~f1_6~0=v_~f1_6~0_104, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_41|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_63|, ~f1_2~0=v_~f1_2~0_108, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_41|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_39|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_59|, ~n_0~0=v_~n_0~0_85, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_41|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_41|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_47|, ~f2_3~0=v_~f2_3~0_97, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_53|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_63|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_53|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_65|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_65|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_65|, ~f2_7~0=v_~f2_7~0_111, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_49|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_35|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-05 23:59:45,862 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [778] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_45| |v_thread1Thread1of1ForFork0_plus_~a#1_63|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_45| v_~f2_3~0_116) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_88|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (= v_~f1_6~0_125 |v_thread2Thread1of1ForFork1_plus_#in~a#1_41|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_149|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_71| |v_thread2Thread1of1ForFork1_plus_#in~b#1_45|) (= v_~l_8~0_59 (ite (< 0 v_~f1_6~0_124) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_63|) (= v_~f1_2~0_128 |v_thread1Thread1of1ForFork0_plus_#res#1_59|) (= v_~f2_7~0_132 |v_thread2Thread1of1ForFork1_plus_#in~b#1_45|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_75|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_75| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_75|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_75| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_75| |v_thread2Thread1of1ForFork1_minus_#res#1_59|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_75| |v_thread1Thread1of1ForFork0_minus_#in~a#1_41|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_15|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_75| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_75| 2147483648)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_75| 0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_51| v_~f1_6~0_124) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_87| v_~n_0~0_95)) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_57| 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_119| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_75| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_75|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_75|)) 1 0)) (<= v_~f1_2~0_128 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_51| 2147483647) (= v_~f1_6~0_124 |v_thread2Thread1of1ForFork1_minus_#in~a#1_53|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_69| |v_thread2Thread1of1ForFork1_plus_#in~a#1_41|) (= v_~f1_2~0_128 |v_thread1Thread1of1ForFork0_minus_#in~a#1_41|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_43| v_~f2_3~0_116) (= |v_thread2Thread1of1ForFork1_minus_~a#1_75| |v_thread2Thread1of1ForFork1_minus_#in~a#1_53|) (< |v_thread2Thread1of1ForFork1_~i~1#1_88| v_~n_0~0_95) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_51| 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_59| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_63| |v_thread1Thread1of1ForFork0_plus_~b#1_63|)) (<= 0 (+ v_~f2_7~0_131 2147483648)) (= v_~f2_3~0_115 |v_thread1Thread1of1ForFork0_minus_#res#1_57|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_75| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_75| |v_thread1Thread1of1ForFork0_minus_#res#1_57|)) (< |v_thread1Thread1of1ForFork0_~i~0#1_77| (+ v_~n_0~0_95 1)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_51| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_69| |v_thread2Thread1of1ForFork1_plus_~b#1_71|)) (= v_~f2_7~0_131 |v_thread2Thread1of1ForFork1_minus_#res#1_59|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_119| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_147|) (<= 0 (+ v_~f1_2~0_128 2147483648)) (<= v_~f2_7~0_131 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_75| |v_thread2Thread1of1ForFork1_minus_#in~b#1_53|) (= v_~f1_2~0_129 |v_thread1Thread1of1ForFork0_plus_#in~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_75| |v_thread1Thread1of1ForFork0_minus_#in~b#1_43|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork0_~i~0#1_77| 1) (= v_~f2_7~0_132 |v_thread2Thread1of1ForFork1_minus_#in~b#1_53|)) InVars {~f1_2~0=v_~f1_2~0_129, ~f2_3~0=v_~f2_3~0_116, ~n_0~0=v_~n_0~0_95, ~f2_7~0=v_~f2_7~0_132, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_88|, ~f1_6~0=v_~f1_6~0_125} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_41|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_15|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_69|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_59|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_59|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_119|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f1_6~0=v_~f1_6~0_124, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_53|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_75|, ~f1_2~0=v_~f1_2~0_128, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_53|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_51|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_41|, ~n_0~0=v_~n_0~0_95, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_71|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_51|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_149|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_53|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_41|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_57|, ~f2_3~0=v_~f2_3~0_115, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_63|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_75|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_63|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_45|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_147|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_43|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_15|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_75|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_75|, ~l_8~0=v_~l_8~0_59, ~f2_7~0=v_~f2_7~0_131, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_59|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_45|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_53|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~l_8~0, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-05 23:59:47,079 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:59:47,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2964 [2022-12-05 23:59:47,080 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 348 flow [2022-12-05 23:59:47,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-05 23:59:47,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:47,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:47,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:59:47,080 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:59:47,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:47,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1330028488, now seen corresponding path program 1 times [2022-12-05 23:59:47,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:47,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583353378] [2022-12-05 23:59:47,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:47,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:47,112 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-05 23:59:47,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:47,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583353378] [2022-12-05 23:59:47,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583353378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:47,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:47,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:59:47,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904112418] [2022-12-05 23:59:47,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:47,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:59:47,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:47,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:59:47,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:59:47,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 23:59:47,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 348 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-05 23:59:47,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:47,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 23:59:47,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:47,202 INFO L130 PetriNetUnfolder]: 126/223 cut-off events. [2022-12-05 23:59:47,202 INFO L131 PetriNetUnfolder]: For 914/914 co-relation queries the response was YES. [2022-12-05 23:59:47,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 223 events. 126/223 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 743 event pairs, 3 based on Foata normal form. 6/229 useless extension candidates. Maximal degree in co-relation 1132. Up to 109 conditions per place. [2022-12-05 23:59:47,204 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 42 selfloop transitions, 16 changer transitions 1/59 dead transitions. [2022-12-05 23:59:47,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 596 flow [2022-12-05 23:59:47,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:59:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:59:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-05 23:59:47,204 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3695652173913043 [2022-12-05 23:59:47,204 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 348 flow. Second operand 6 states and 51 transitions. [2022-12-05 23:59:47,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 596 flow [2022-12-05 23:59:47,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 531 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-12-05 23:59:47,207 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 336 flow [2022-12-05 23:59:47,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=336, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2022-12-05 23:59:47,208 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 34 predicate places. [2022-12-05 23:59:47,208 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:47,208 INFO L89 Accepts]: Start accepts. Operand has 54 places, 36 transitions, 336 flow [2022-12-05 23:59:47,208 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:47,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:47,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 36 transitions, 336 flow [2022-12-05 23:59:47,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 36 transitions, 336 flow [2022-12-05 23:59:47,215 INFO L130 PetriNetUnfolder]: 22/73 cut-off events. [2022-12-05 23:59:47,215 INFO L131 PetriNetUnfolder]: For 238/244 co-relation queries the response was YES. [2022-12-05 23:59:47,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 73 events. 22/73 cut-off events. For 238/244 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 246 event pairs, 0 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 274. Up to 23 conditions per place. [2022-12-05 23:59:47,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 36 transitions, 336 flow [2022-12-05 23:59:47,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-05 23:59:47,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [774] $Ultimate##0-->L54-5: Formula: (let ((.cse0 (+ v_~n_0~0_89 1))) (and (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_41| |v_thread1Thread1of1ForFork0_plus_~b#1_59|) (= v_~f1_6~0_108 |v_thread2Thread1of1ForFork1_minus_#in~a#1_43|) (<= v_~f1_2~0_118 2147483647) (= |v_thread1Thread1of1ForFork0_~i~0#1_71| 1) (= v_~f1_2~0_118 |v_thread1Thread1of1ForFork0_plus_#res#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_39| v_~f2_3~0_108) (= |v_thread1Thread1of1ForFork0_plus_#res#1_55| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_59| |v_thread1Thread1of1ForFork0_plus_~b#1_59|)) (<= 0 (+ v_~f1_2~0_118 2147483648)) (<= |v_thread2Thread1of1ForFork1_minus_#in~b#1_43| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#res#1_41| v_~f1_6~0_108) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_41| 2147483648)) (= (+ |v_thread2Thread1of1ForFork1_plus_~a#1_59| |v_thread2Thread1of1ForFork1_plus_~b#1_61|) |v_thread2Thread1of1ForFork1_plus_#res#1_41|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_71| |v_thread1Thread1of1ForFork0_minus_#in~b#1_39|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_41| v_~f2_3~0_108) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_145|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= v_~f2_7~0_115 |v_thread2Thread1of1ForFork1_minus_#res#1_49|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#res#1_49|)) (= v_~f2_3~0_107 |v_thread1Thread1of1ForFork0_minus_#res#1_53|) (< |v_thread2Thread1of1ForFork1_~i~1#1_71| .cse0) (= v_~f1_2~0_118 |v_thread1Thread1of1ForFork0_minus_#in~a#1_37|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_41| |v_thread1Thread1of1ForFork0_plus_~a#1_59|) (<= 0 (+ 2147483648 |v_thread2Thread1of1ForFork1_plus_#in~a#1_31|)) (= (+ v_~f2_7~0_117 v_~f1_6~0_110) |v_thread2Thread1of1ForFork1_plus_#in~a#1_31|) (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_43| 2147483648)) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_71| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_71| 2147483648)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_71| 0)) 1 0) 0)) (<= v_~f2_7~0_115 2147483647) (= v_~f1_2~0_119 |v_thread1Thread1of1ForFork0_plus_#in~a#1_41|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_65|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_65|))) 1 0)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_61| |v_thread2Thread1of1ForFork1_plus_#in~b#1_35|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_71| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_71|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_71|)) 1 0)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_41| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_71| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_71| |v_thread1Thread1of1ForFork0_minus_#res#1_53|)) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_43| |v_thread2Thread1of1ForFork1_plus_#in~b#1_35|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_71| |v_thread1Thread1of1ForFork0_minus_#in~a#1_37|) (= (+ v_~f2_7~0_117 |v_thread2Thread1of1ForFork1_minus_#in~b#1_43|) |v_thread2Thread1of1ForFork1_plus_#in~a#1_31|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_59| |v_thread2Thread1of1ForFork1_plus_#in~a#1_31|) (< |v_thread1Thread1of1ForFork0_~i~0#1_71| .cse0) (= |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#in~b#1_43|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| |v_thread2Thread1of1ForFork1_minus_#in~a#1_43|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_53| 2147483647))) InVars {~f1_2~0=v_~f1_2~0_119, ~f2_3~0=v_~f2_3~0_108, ~n_0~0=v_~n_0~0_89, ~f2_7~0=v_~f2_7~0_117, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~f1_6~0=v_~f1_6~0_110} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_35|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_37|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_59|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_55|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_41|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f1_6~0=v_~f1_6~0_108, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_43|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_65|, ~f1_2~0=v_~f1_2~0_118, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_43|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_41|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_37|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_61|, ~n_0~0=v_~n_0~0_89, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_145|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_43|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_31|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_53|, ~f2_3~0=v_~f2_3~0_107, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_59|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_65|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_59|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_39|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_71|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_71|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_71|, ~f2_7~0=v_~f2_7~0_115, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_55|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_41|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [492] $Ultimate##0-->L54-5: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] [2022-12-05 23:59:47,749 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] $Ultimate##0-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_~b#1_81| |v_thread1Thread1of1ForFork0_minus_#in~b#1_49|) (= v_~f1_2~0_138 |v_thread1Thread1of1ForFork0_minus_#in~a#1_47|) (< 1 v_~n_0~0_99) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_81| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_81|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_81|)) 1 0)) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~a#1_51| 2147483648)) (<= v_~f2_7~0_139 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_51| |v_thread1Thread1of1ForFork0_plus_~b#1_69|) (= v_~f1_6~0_132 |v_thread2Thread1of1ForFork1_minus_#in~a#1_57|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_51| |v_thread1Thread1of1ForFork0_minus_#in~b#1_49|) (= v_~f2_7~0_140 |v_thread2Thread1of1ForFork1_plus_#in~b#1_49|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_65| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_69| |v_thread1Thread1of1ForFork0_plus_~b#1_69|)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_96|) |v_thread2Thread1of1ForFork1_~i~1#1_95|) (<= |v_thread1Thread1of1ForFork0_minus_#in~b#1_49| 2147483647) (= |v_thread2Thread1of1ForFork1_#res#1.offset_17| 0) (= |v_thread2Thread1of1ForFork1_minus_~b#1_79| |v_thread2Thread1of1ForFork1_minus_#in~b#1_57|) (= v_~f2_7~0_140 |v_thread2Thread1of1ForFork1_minus_#in~b#1_57|) (< |v_thread2Thread1of1ForFork1_~i~1#1_96| v_~n_0~0_99) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_123| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|) (= v_~l_8~0_61 (ite (< 0 v_~f1_6~0_132) 1 0)) (= v_~f1_2~0_138 |v_thread1Thread1of1ForFork0_plus_#res#1_65|) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| v_~n_0~0_99)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_79| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_79| |v_thread2Thread1of1ForFork1_minus_#res#1_63|)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_55| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_81| |v_thread1Thread1of1ForFork0_minus_#in~a#1_47|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_123| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_79|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_79| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_79|))) 1 0)) (<= v_~f1_2~0_138 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_55| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~a#1_73| |v_thread2Thread1of1ForFork1_plus_#in~a#1_45|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_55| v_~f1_6~0_132) (= (+ |v_thread1Thread1of1ForFork0_minus_#in~b#1_49| v_~f2_3~0_127) |v_thread1Thread1of1ForFork0_plus_#in~a#1_51|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_81| |v_thread1Thread1of1ForFork0_minus_#res#1_63|) |v_thread1Thread1of1ForFork0_minus_~a#1_81|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_79| |v_thread2Thread1of1ForFork1_minus_#in~a#1_57|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_17|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_plus_#in~a#1_51| |v_thread1Thread1of1ForFork0_minus_#in~b#1_49|) (<= 0 (+ |v_thread1Thread1of1ForFork0_minus_#in~b#1_49| 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_51| (+ v_~f1_2~0_140 v_~f2_3~0_127)) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_63| 2147483647) (<= 0 (+ v_~f1_2~0_138 2147483648)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_155|) (<= 0 (+ v_~f2_7~0_139 2147483648)) (= v_~f2_3~0_125 |v_thread1Thread1of1ForFork0_minus_#res#1_63|) (= v_~f2_7~0_139 |v_thread2Thread1of1ForFork1_minus_#res#1_63|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_51| |v_thread1Thread1of1ForFork0_plus_~a#1_69|) (= (+ |v_thread2Thread1of1ForFork1_plus_~a#1_73| |v_thread2Thread1of1ForFork1_plus_~b#1_75|) |v_thread2Thread1of1ForFork1_plus_#res#1_55|) (= v_~f1_6~0_133 |v_thread2Thread1of1ForFork1_plus_#in~a#1_45|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_75| |v_thread2Thread1of1ForFork1_plus_#in~b#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_83| 2)) InVars {~f1_2~0=v_~f1_2~0_140, ~f2_3~0=v_~f2_3~0_127, ~n_0~0=v_~n_0~0_99, ~f2_7~0=v_~f2_7~0_140, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_96|, ~f1_6~0=v_~f1_6~0_133} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_49|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_47|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_65|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_17|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_73|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_51|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_63|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_123|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_95|, ~f1_6~0=v_~f1_6~0_132, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_57|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_79|, ~f1_2~0=v_~f1_2~0_138, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_47|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_57|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_55|, ~n_0~0=v_~n_0~0_99, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_75|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_155|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_57|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_45|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_63|, ~f2_3~0=v_~f2_3~0_125, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_69|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_79|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_69|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_49|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_17|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_81|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_83|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_81|, ~l_8~0=v_~l_8~0_61, ~f2_7~0=v_~f2_7~0_139, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_65|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_51|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_57|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~l_8~0, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [492] $Ultimate##0-->L54-5: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] [2022-12-05 23:59:48,377 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [780] $Ultimate##0-->L44-5: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_47| v_~f2_3~0_121))) (and (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_77| |v_thread1Thread1of1ForFork0_minus_#res#1_59|) |v_thread1Thread1of1ForFork0_minus_~a#1_77|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_92|) |v_thread2Thread1of1ForFork1_~i~1#1_91|) (= v_~f1_2~0_132 |v_thread1Thread1of1ForFork0_minus_#in~a#1_43|) (<= 0 (+ v_~f2_7~0_135 2147483648)) (= v_~f1_2~0_132 |v_thread1Thread1of1ForFork0_plus_#res#1_61|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_77| |v_thread2Thread1of1ForFork1_minus_#res#1_61|) |v_thread2Thread1of1ForFork1_minus_~a#1_77|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_53| v_~f1_6~0_128) (< 1 v_~n_0~0_97) (= |v_thread2Thread1of1ForFork1_plus_#res#1_53| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_71| |v_thread2Thread1of1ForFork1_plus_~b#1_73|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_77| |v_thread1Thread1of1ForFork0_minus_#in~a#1_43|) (= v_~f1_2~0_134 |v_thread1Thread1of1ForFork0_plus_#in~b#1_47|) (not (= (ite (or (<= v_~f2_3~0_121 0) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_47| 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_79| 2) (= |v_thread1Thread1of1ForFork0_minus_~b#1_77| |v_thread1Thread1of1ForFork0_minus_#in~b#1_45|) (= v_~f1_6~0_128 |v_thread2Thread1of1ForFork1_minus_#in~a#1_55|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_77| |v_thread2Thread1of1ForFork1_minus_#in~b#1_55|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_47| |v_thread1Thread1of1ForFork0_plus_~a#1_65|) (< |v_thread2Thread1of1ForFork1_~i~1#1_92| v_~n_0~0_97) (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_47| 2147483647) (<= v_~f1_2~0_132 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_77| |v_thread2Thread1of1ForFork1_minus_#in~a#1_55|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_53| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_73| |v_thread2Thread1of1ForFork1_plus_#in~b#1_47|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_47| .cse0) (= |v_thread2Thread1of1ForFork1_plus_~a#1_71| |v_thread2Thread1of1ForFork1_plus_#in~a#1_43|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_47| |v_thread1Thread1of1ForFork0_plus_~b#1_65|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_53| 2147483647) (<= 0 (+ v_~f1_2~0_132 2147483648)) (= v_~f1_6~0_129 |v_thread2Thread1of1ForFork1_plus_#in~a#1_43|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_149|) (= v_~f2_3~0_119 |v_thread1Thread1of1ForFork0_minus_#res#1_59|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_119| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_77| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_77|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_77|)) 1 0)) (<= v_~f2_7~0_135 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_77|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_77| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_77|))) 1 0)) (= v_~f2_7~0_135 |v_thread2Thread1of1ForFork1_minus_#res#1_61|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_47| v_~f2_3~0_121 2147483648)) (= v_~f2_7~0_136 |v_thread2Thread1of1ForFork1_plus_#in~b#1_47|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_61| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_65| |v_thread1Thread1of1ForFork0_plus_~b#1_65|)) (= v_~f2_7~0_136 |v_thread2Thread1of1ForFork1_minus_#in~b#1_55|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_45|) (<= .cse0 2147483647) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_119| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_151|))) InVars {~f1_2~0=v_~f1_2~0_134, ~f2_3~0=v_~f2_3~0_121, ~n_0~0=v_~n_0~0_97, ~f2_7~0=v_~f2_7~0_136, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_92|, ~f1_6~0=v_~f1_6~0_129} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_43|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_61|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_71|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_47|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_61|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_91|, ~f1_6~0=v_~f1_6~0_128, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_55|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_77|, ~f1_2~0=v_~f1_2~0_132, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_43|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_55|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_53|, ~n_0~0=v_~n_0~0_97, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_73|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_53|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_151|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_55|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_43|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_59|, ~f2_3~0=v_~f2_3~0_119, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_65|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_77|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_65|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_47|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_45|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_149|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_119|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_77|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_77|, ~f2_7~0=v_~f2_7~0_135, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_61|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_47|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_55|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [492] $Ultimate##0-->L54-5: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] [2022-12-05 23:59:48,857 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] and [492] $Ultimate##0-->L54-5: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] [2022-12-05 23:59:48,959 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] and [492] $Ultimate##0-->L54-5: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] [2022-12-05 23:59:49,054 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-05 23:59:49,054 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:59:49,055 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-05 23:59:49,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:59:49,056 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) 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-05 23:59:49,059 INFO L158 Benchmark]: Toolchain (without parser) took 20063.78ms. Allocated memory was 211.8MB in the beginning and 475.0MB in the end (delta: 263.2MB). Free memory was 187.9MB in the beginning and 312.6MB in the end (delta: -124.6MB). Peak memory consumption was 278.0MB. Max. memory is 8.0GB. [2022-12-05 23:59:49,059 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 211.8MB. Free memory was 188.1MB in the beginning and 188.0MB in the end (delta: 82.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:59:49,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.19ms. Allocated memory is still 211.8MB. Free memory was 187.9MB in the beginning and 175.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-05 23:59:49,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.78ms. Allocated memory is still 211.8MB. Free memory was 175.9MB in the beginning and 173.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:59:49,060 INFO L158 Benchmark]: Boogie Preprocessor took 38.53ms. Allocated memory is still 211.8MB. Free memory was 173.8MB in the beginning and 172.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:59:49,060 INFO L158 Benchmark]: RCFGBuilder took 333.27ms. Allocated memory is still 211.8MB. Free memory was 172.2MB in the beginning and 154.9MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-05 23:59:49,060 INFO L158 Benchmark]: TraceAbstraction took 19429.68ms. Allocated memory was 211.8MB in the beginning and 475.0MB in the end (delta: 263.2MB). Free memory was 154.4MB in the beginning and 312.6MB in the end (delta: -158.2MB). Peak memory consumption was 244.5MB. Max. memory is 8.0GB. [2022-12-05 23:59:49,061 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.10ms. Allocated memory is still 211.8MB. Free memory was 188.1MB in the beginning and 188.0MB in the end (delta: 82.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.19ms. Allocated memory is still 211.8MB. Free memory was 187.9MB in the beginning and 175.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.78ms. Allocated memory is still 211.8MB. Free memory was 175.9MB in the beginning and 173.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.53ms. Allocated memory is still 211.8MB. Free memory was 173.8MB in the beginning and 172.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 333.27ms. Allocated memory is still 211.8MB. Free memory was 172.2MB in the beginning and 154.9MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 19429.68ms. Allocated memory was 211.8MB in the beginning and 475.0MB in the end (delta: 263.2MB). Free memory was 154.4MB in the beginning and 312.6MB in the end (delta: -158.2MB). Peak memory consumption was 244.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 172 PlacesBefore, 20 PlacesAfterwards, 179 TransitionsBefore, 15 TransitionsAfterwards, 7452 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 53 TrivialYvCompositions, 99 ConcurrentYvCompositions, 12 ChoiceCompositions, 164 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4839, independent: 4839, independent conditional: 4839, 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: 4839, independent: 4839, independent conditional: 0, independent unconditional: 4839, 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: 4839, independent: 4839, independent conditional: 0, independent unconditional: 4839, 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: 4839, independent: 4839, independent conditional: 0, independent unconditional: 4839, 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: 4314, independent: 4314, independent conditional: 0, independent unconditional: 4314, 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: 4314, independent: 4314, independent conditional: 0, independent unconditional: 4314, 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: 4839, independent: 525, independent conditional: 0, independent unconditional: 525, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4314, unknown conditional: 0, unknown unconditional: 4314] , Statistics on independence cache: Total cache size (in pairs): 8931, Positive cache size: 8931, Positive conditional cache size: 0, Positive unconditional cache size: 8931, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 22 PlacesBefore, 22 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4, Positive cache size: 4, Positive conditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 82 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): 4, Positive cache size: 4, Positive conditional cache size: 4, 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.3s, 26 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 4, Positive unconditional cache size: 1, 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: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 30 PlacesBefore, 29 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 3, independent unconditional: 9, 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: 12, independent: 12, independent conditional: 3, independent unconditional: 9, 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: 4, independent: 4, independent conditional: 1, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 12, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 5, Positive unconditional cache size: 4, 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: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 33 PlacesBefore, 33 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 9, Positive unconditional cache size: 5, 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: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 110 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): 14, Positive cache size: 14, Positive conditional cache size: 9, Positive unconditional cache size: 5, 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, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 120 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): 14, Positive cache size: 14, Positive conditional cache size: 9, Positive unconditional cache size: 5, 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, 40 PlacesBefore, 40 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): 14, Positive cache size: 14, Positive conditional cache size: 9, Positive unconditional cache size: 5, 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, 46 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 13, Positive unconditional cache size: 5, 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: 1.3s, 47 PlacesBefore, 47 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 13, Positive unconditional cache size: 5, 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, 49 PlacesBefore, 49 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 142 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: 13, Positive unconditional cache size: 5, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 52 PlacesBefore, 51 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 19, Positive conditional cache size: 14, Positive unconditional cache size: 5, 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: 1.8s, 52 PlacesBefore, 52 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 14, 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: 26, independent: 26, independent conditional: 14, 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: 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: 26, independent: 17, independent conditional: 8, independent unconditional: 9, 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): 28, Positive cache size: 28, Positive conditional cache size: 20, Positive unconditional cache size: 8, 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: 12, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-05 23:59:49,094 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...