/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 13:09:27,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:09:27,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:09:27,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:09:27,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:09:27,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:09:27,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:09:27,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:09:27,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:09:27,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:09:27,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:09:27,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:09:27,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:09:27,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:09:27,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:09:27,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:09:27,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:09:27,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:09:27,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:09:27,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:09:27,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:09:27,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:09:27,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:09:27,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:09:27,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:09:27,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:09:27,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:09:27,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:09:27,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:09:27,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:09:27,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:09:27,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:09:27,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:09:27,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:09:27,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:09:27,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:09:27,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:09:27,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:09:27,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:09:27,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:09:27,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:09:27,294 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 13:09:27,310 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:09:27,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:09:27,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:09:27,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:09:27,312 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:09:27,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:09:27,312 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:09:27,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:09:27,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:09:27,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:09:27,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:09:27,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:09:27,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:09:27,313 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:09:27,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:09:27,314 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:09:27,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:09:27,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:09:27,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:09:27,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 13:09:27,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:09:27,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:09:27,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:09:27,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:09:27,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:09:27,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:09:27,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:09:27,315 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 13:09:27,315 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-13 13:09:27,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:09:27,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:09:27,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:09:27,566 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:09:27,566 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:09:27,567 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2022-12-13 13:09:28,437 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:09:28,619 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:09:28,620 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2022-12-13 13:09:28,624 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3819f8a2/b9328482be8745ff928a18f9a212cbe5/FLAG1fe54d974 [2022-12-13 13:09:28,633 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3819f8a2/b9328482be8745ff928a18f9a212cbe5 [2022-12-13 13:09:28,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:09:28,637 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 13:09:28,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:09:28,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:09:28,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:09:28,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:09:28" (1/1) ... [2022-12-13 13:09:28,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef0a1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:28, skipping insertion in model container [2022-12-13 13:09:28,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:09:28" (1/1) ... [2022-12-13 13:09:28,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:09:28,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:09:28,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:09:28,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:09:28,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:09:28,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:09:28,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:09:28,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:09:28,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:09:28,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:09:28,796 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2022-12-13 13:09:28,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:09:28,812 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:09:28,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:09:28,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:09:28,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:09:28,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:09:28,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:09:28,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:09:28,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:09:28,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:09:28,845 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2022-12-13 13:09:28,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:09:28,858 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:09:28,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:28 WrapperNode [2022-12-13 13:09:28,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:09:28,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:09:28,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:09:28,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:09:28,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:28" (1/1) ... [2022-12-13 13:09:28,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:28" (1/1) ... [2022-12-13 13:09:28,901 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2022-12-13 13:09:28,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:09:28,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:09:28,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:09:28,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:09:28,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:28" (1/1) ... [2022-12-13 13:09:28,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:28" (1/1) ... [2022-12-13 13:09:28,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:28" (1/1) ... [2022-12-13 13:09:28,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:28" (1/1) ... [2022-12-13 13:09:28,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:28" (1/1) ... [2022-12-13 13:09:28,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:28" (1/1) ... [2022-12-13 13:09:28,931 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:28" (1/1) ... [2022-12-13 13:09:28,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:28" (1/1) ... [2022-12-13 13:09:28,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:09:28,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:09:28,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:09:28,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:09:28,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:28" (1/1) ... [2022-12-13 13:09:28,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:09:28,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:09:28,965 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-13 13:09:28,971 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-13 13:09:29,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:09:29,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 13:09:29,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 13:09:29,001 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 13:09:29,001 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 13:09:29,001 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 13:09:29,001 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 13:09:29,001 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 13:09:29,001 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 13:09:29,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:09:29,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:09:29,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:09:29,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:09:29,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:09:29,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:09:29,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:09:29,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:09:29,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:09:29,003 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 13:09:29,099 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 13:09:29,101 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:09:29,315 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 13:09:29,371 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:09:29,372 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 13:09:29,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:09:29 BoogieIcfgContainer [2022-12-13 13:09:29,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:09:29,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:09:29,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:09:29,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:09:29,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:09:28" (1/3) ... [2022-12-13 13:09:29,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75684106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:09:29, skipping insertion in model container [2022-12-13 13:09:29,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:28" (2/3) ... [2022-12-13 13:09:29,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75684106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:09:29, skipping insertion in model container [2022-12-13 13:09:29,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:09:29" (3/3) ... [2022-12-13 13:09:29,381 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2022-12-13 13:09:29,393 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:09:29,394 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:09:29,394 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:09:29,455 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 13:09:29,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 119 transitions, 270 flow [2022-12-13 13:09:29,522 INFO L130 PetriNetUnfolder]: 9/115 cut-off events. [2022-12-13 13:09:29,522 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 13:09:29,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 115 events. 9/115 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-13 13:09:29,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 119 transitions, 270 flow [2022-12-13 13:09:29,535 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 103 transitions, 230 flow [2022-12-13 13:09:29,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:29,556 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 103 transitions, 230 flow [2022-12-13 13:09:29,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 103 transitions, 230 flow [2022-12-13 13:09:29,583 INFO L130 PetriNetUnfolder]: 9/103 cut-off events. [2022-12-13 13:09:29,583 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 13:09:29,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 103 events. 9/103 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-13 13:09:29,587 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 103 transitions, 230 flow [2022-12-13 13:09:29,587 INFO L226 LiptonReduction]: Number of co-enabled transitions 2520 [2022-12-13 13:09:32,293 INFO L241 LiptonReduction]: Total number of compositions: 74 [2022-12-13 13:09:32,304 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:09:32,308 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;@14c80807, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 13:09:32,308 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 13:09:32,313 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2022-12-13 13:09:32,314 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 13:09:32,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:32,320 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:32,321 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:32,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:32,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2014537320, now seen corresponding path program 1 times [2022-12-13 13:09:32,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:32,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244781354] [2022-12-13 13:09:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:32,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:32,706 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-13 13:09:32,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:32,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244781354] [2022-12-13 13:09:32,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244781354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:32,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:32,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:09:32,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113685759] [2022-12-13 13:09:32,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:32,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:09:32,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:32,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:09:32,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:09:32,732 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-13 13:09:32,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-13 13:09:32,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:32,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-13 13:09:32,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:32,946 INFO L130 PetriNetUnfolder]: 1537/1954 cut-off events. [2022-12-13 13:09:32,946 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2022-12-13 13:09:32,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4056 conditions, 1954 events. 1537/1954 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6421 event pairs, 141 based on Foata normal form. 1/1127 useless extension candidates. Maximal degree in co-relation 3091. Up to 1733 conditions per place. [2022-12-13 13:09:32,963 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2022-12-13 13:09:32,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 241 flow [2022-12-13 13:09:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:09:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:09:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-13 13:09:32,973 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2022-12-13 13:09:32,974 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 82 flow. Second operand 3 states and 60 transitions. [2022-12-13 13:09:32,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 241 flow [2022-12-13 13:09:32,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 51 transitions, 211 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-13 13:09:32,982 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 99 flow [2022-12-13 13:09:32,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2022-12-13 13:09:32,987 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2022-12-13 13:09:32,987 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:32,988 INFO L89 Accepts]: Start accepts. Operand has 33 places, 33 transitions, 99 flow [2022-12-13 13:09:32,990 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:32,990 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:32,991 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 33 transitions, 99 flow [2022-12-13 13:09:32,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 33 transitions, 99 flow [2022-12-13 13:09:32,999 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([370] thread3EXIT-->L94-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][29], [Black: 128#(= ~counter2~0 ~counter1~0), 108#$Ultimate##0true, 126#true, 81#L94-2true]) [2022-12-13 13:09:32,999 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-13 13:09:32,999 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 13:09:33,000 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-13 13:09:33,000 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 13:09:33,002 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] thread4EXIT-->L95-2: Formula: (and (= v_thread4Thread1of1ForFork0_thidvar1_4 0) (= v_thread4Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread4Thread1of1ForFork0_thidvar0_4) (= v_thread4Thread1of1ForFork0_thidvar3_4 0) (= v_thread4Thread1of1ForFork0_thidvar4_4 0)) InVars {thread4Thread1of1ForFork0_thidvar4=v_thread4Thread1of1ForFork0_thidvar4_4, thread4Thread1of1ForFork0_thidvar3=v_thread4Thread1of1ForFork0_thidvar3_4, thread4Thread1of1ForFork0_thidvar2=v_thread4Thread1of1ForFork0_thidvar2_4, thread4Thread1of1ForFork0_thidvar1=v_thread4Thread1of1ForFork0_thidvar1_4, thread4Thread1of1ForFork0_thidvar0=v_thread4Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread4Thread1of1ForFork0_thidvar4=v_thread4Thread1of1ForFork0_thidvar4_4, thread4Thread1of1ForFork0_thidvar3=v_thread4Thread1of1ForFork0_thidvar3_4, thread4Thread1of1ForFork0_thidvar2=v_thread4Thread1of1ForFork0_thidvar2_4, thread4Thread1of1ForFork0_thidvar1=v_thread4Thread1of1ForFork0_thidvar1_4, thread4Thread1of1ForFork0_thidvar0=v_thread4Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][31], [Black: 128#(= ~counter2~0 ~counter1~0), 76#L95-2true, 126#true]) [2022-12-13 13:09:33,005 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2022-12-13 13:09:33,009 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-13 13:09:33,009 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-12-13 13:09:33,009 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-12-13 13:09:33,011 INFO L130 PetriNetUnfolder]: 59/127 cut-off events. [2022-12-13 13:09:33,011 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:09:33,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 127 events. 59/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 341 event pairs, 6 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 155. Up to 66 conditions per place. [2022-12-13 13:09:33,014 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 33 transitions, 99 flow [2022-12-13 13:09:33,014 INFO L226 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-13 13:09:33,015 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:09:33,016 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 13:09:33,017 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 99 flow [2022-12-13 13:09:33,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-13 13:09:33,017 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:33,017 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:33,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:09:33,020 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:33,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:33,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2118314327, now seen corresponding path program 1 times [2022-12-13 13:09:33,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:33,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684384841] [2022-12-13 13:09:33,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:33,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:33,174 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-13 13:09:33,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:33,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684384841] [2022-12-13 13:09:33,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684384841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:33,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:33,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:09:33,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454834190] [2022-12-13 13:09:33,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:33,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:09:33,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:33,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:09:33,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:09:33,177 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 13:09:33,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-13 13:09:33,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:33,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 13:09:33,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:33,446 INFO L130 PetriNetUnfolder]: 2637/3503 cut-off events. [2022-12-13 13:09:33,447 INFO L131 PetriNetUnfolder]: For 976/976 co-relation queries the response was YES. [2022-12-13 13:09:33,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8577 conditions, 3503 events. 2637/3503 cut-off events. For 976/976 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 15147 event pairs, 562 based on Foata normal form. 58/3491 useless extension candidates. Maximal degree in co-relation 2404. Up to 1483 conditions per place. [2022-12-13 13:09:33,466 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 90 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2022-12-13 13:09:33,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 97 transitions, 479 flow [2022-12-13 13:09:33,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:09:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:09:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-13 13:09:33,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6482758620689655 [2022-12-13 13:09:33,470 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 99 flow. Second operand 5 states and 94 transitions. [2022-12-13 13:09:33,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 97 transitions, 479 flow [2022-12-13 13:09:33,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 97 transitions, 466 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:09:33,472 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 129 flow [2022-12-13 13:09:33,473 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2022-12-13 13:09:33,473 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2022-12-13 13:09:33,473 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:33,473 INFO L89 Accepts]: Start accepts. Operand has 39 places, 36 transitions, 129 flow [2022-12-13 13:09:33,476 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:33,476 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:33,476 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 36 transitions, 129 flow [2022-12-13 13:09:33,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 36 transitions, 129 flow [2022-12-13 13:09:33,485 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] thread4EXIT-->L95-2: Formula: (and (= v_thread4Thread1of1ForFork0_thidvar1_4 0) (= v_thread4Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread4Thread1of1ForFork0_thidvar0_4) (= v_thread4Thread1of1ForFork0_thidvar3_4 0) (= v_thread4Thread1of1ForFork0_thidvar4_4 0)) InVars {thread4Thread1of1ForFork0_thidvar4=v_thread4Thread1of1ForFork0_thidvar4_4, thread4Thread1of1ForFork0_thidvar3=v_thread4Thread1of1ForFork0_thidvar3_4, thread4Thread1of1ForFork0_thidvar2=v_thread4Thread1of1ForFork0_thidvar2_4, thread4Thread1of1ForFork0_thidvar1=v_thread4Thread1of1ForFork0_thidvar1_4, thread4Thread1of1ForFork0_thidvar0=v_thread4Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread4Thread1of1ForFork0_thidvar4=v_thread4Thread1of1ForFork0_thidvar4_4, thread4Thread1of1ForFork0_thidvar3=v_thread4Thread1of1ForFork0_thidvar3_4, thread4Thread1of1ForFork0_thidvar2=v_thread4Thread1of1ForFork0_thidvar2_4, thread4Thread1of1ForFork0_thidvar1=v_thread4Thread1of1ForFork0_thidvar1_4, thread4Thread1of1ForFork0_thidvar0=v_thread4Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][34], [136#(and (<= ~N~0 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 128#(= ~counter2~0 ~counter1~0), 76#L95-2true, Black: 132#(= thread1Thread1of1ForFork3_~i~0 0), Black: 138#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0))]) [2022-12-13 13:09:33,485 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2022-12-13 13:09:33,485 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-12-13 13:09:33,485 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-12-13 13:09:33,485 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-13 13:09:33,487 INFO L130 PetriNetUnfolder]: 63/153 cut-off events. [2022-12-13 13:09:33,487 INFO L131 PetriNetUnfolder]: For 29/56 co-relation queries the response was YES. [2022-12-13 13:09:33,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 153 events. 63/153 cut-off events. For 29/56 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 497 event pairs, 6 based on Foata normal form. 7/139 useless extension candidates. Maximal degree in co-relation 220. Up to 68 conditions per place. [2022-12-13 13:09:33,488 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 36 transitions, 129 flow [2022-12-13 13:09:33,489 INFO L226 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-13 13:09:33,609 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:09:33,610 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 13:09:33,610 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 127 flow [2022-12-13 13:09:33,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-13 13:09:33,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:33,610 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:33,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:09:33,611 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:33,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:33,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1274830927, now seen corresponding path program 1 times [2022-12-13 13:09:33,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:33,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002789778] [2022-12-13 13:09:33,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:33,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:33,662 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-13 13:09:33,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:33,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002789778] [2022-12-13 13:09:33,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002789778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:33,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:33,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:09:33,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093516618] [2022-12-13 13:09:33,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:33,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:09:33,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:33,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:09:33,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:09:33,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-13 13:09:33,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 13:09:33,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:33,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-13 13:09:33,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:33,891 INFO L130 PetriNetUnfolder]: 2534/3369 cut-off events. [2022-12-13 13:09:33,891 INFO L131 PetriNetUnfolder]: For 2961/2979 co-relation queries the response was YES. [2022-12-13 13:09:33,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9178 conditions, 3369 events. 2534/3369 cut-off events. For 2961/2979 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 13868 event pairs, 980 based on Foata normal form. 82/3363 useless extension candidates. Maximal degree in co-relation 6027. Up to 1795 conditions per place. [2022-12-13 13:09:33,908 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 65 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2022-12-13 13:09:33,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 71 transitions, 373 flow [2022-12-13 13:09:33,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:09:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:09:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-13 13:09:33,909 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5967741935483871 [2022-12-13 13:09:33,909 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 127 flow. Second operand 4 states and 74 transitions. [2022-12-13 13:09:33,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 71 transitions, 373 flow [2022-12-13 13:09:33,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 71 transitions, 354 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:09:33,936 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 142 flow [2022-12-13 13:09:33,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2022-12-13 13:09:33,937 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-13 13:09:33,937 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:33,937 INFO L89 Accepts]: Start accepts. Operand has 41 places, 37 transitions, 142 flow [2022-12-13 13:09:33,937 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:33,938 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:33,938 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 37 transitions, 142 flow [2022-12-13 13:09:33,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 142 flow [2022-12-13 13:09:33,947 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] thread4EXIT-->L95-2: Formula: (and (= v_thread4Thread1of1ForFork0_thidvar1_4 0) (= v_thread4Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread4Thread1of1ForFork0_thidvar0_4) (= v_thread4Thread1of1ForFork0_thidvar3_4 0) (= v_thread4Thread1of1ForFork0_thidvar4_4 0)) InVars {thread4Thread1of1ForFork0_thidvar4=v_thread4Thread1of1ForFork0_thidvar4_4, thread4Thread1of1ForFork0_thidvar3=v_thread4Thread1of1ForFork0_thidvar3_4, thread4Thread1of1ForFork0_thidvar2=v_thread4Thread1of1ForFork0_thidvar2_4, thread4Thread1of1ForFork0_thidvar1=v_thread4Thread1of1ForFork0_thidvar1_4, thread4Thread1of1ForFork0_thidvar0=v_thread4Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread4Thread1of1ForFork0_thidvar4=v_thread4Thread1of1ForFork0_thidvar4_4, thread4Thread1of1ForFork0_thidvar3=v_thread4Thread1of1ForFork0_thidvar3_4, thread4Thread1of1ForFork0_thidvar2=v_thread4Thread1of1ForFork0_thidvar2_4, thread4Thread1of1ForFork0_thidvar1=v_thread4Thread1of1ForFork0_thidvar1_4, thread4Thread1of1ForFork0_thidvar0=v_thread4Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][35], [136#(and (<= ~N~0 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 128#(= ~counter2~0 ~counter1~0), Black: 145#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 144#(<= 1 ~N~0), 76#L95-2true, Black: 138#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), 142#true]) [2022-12-13 13:09:33,948 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-12-13 13:09:33,950 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-13 13:09:33,951 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-13 13:09:33,951 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-13 13:09:33,954 INFO L130 PetriNetUnfolder]: 64/154 cut-off events. [2022-12-13 13:09:33,954 INFO L131 PetriNetUnfolder]: For 106/124 co-relation queries the response was YES. [2022-12-13 13:09:33,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 154 events. 64/154 cut-off events. For 106/124 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 482 event pairs, 3 based on Foata normal form. 3/132 useless extension candidates. Maximal degree in co-relation 221. Up to 72 conditions per place. [2022-12-13 13:09:33,955 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 37 transitions, 142 flow [2022-12-13 13:09:33,955 INFO L226 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-13 13:09:34,011 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:09:34,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-13 13:09:34,012 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 136 flow [2022-12-13 13:09:34,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 13:09:34,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:34,012 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:34,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:09:34,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 (and 2 more)] === [2022-12-13 13:09:34,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:34,013 INFO L85 PathProgramCache]: Analyzing trace with hash -373990512, now seen corresponding path program 1 times [2022-12-13 13:09:34,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:34,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715075638] [2022-12-13 13:09:34,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:34,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:34,080 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-13 13:09:34,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:34,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715075638] [2022-12-13 13:09:34,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715075638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:34,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:34,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:09:34,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874291795] [2022-12-13 13:09:34,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:34,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:09:34,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:34,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:09:34,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:09:34,084 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-13 13:09:34,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 13:09:34,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:34,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-13 13:09:34,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:34,422 INFO L130 PetriNetUnfolder]: 3163/4212 cut-off events. [2022-12-13 13:09:34,422 INFO L131 PetriNetUnfolder]: For 4590/4590 co-relation queries the response was YES. [2022-12-13 13:09:34,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11609 conditions, 4212 events. 3163/4212 cut-off events. For 4590/4590 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 18808 event pairs, 801 based on Foata normal form. 92/4224 useless extension candidates. Maximal degree in co-relation 6167. Up to 2111 conditions per place. [2022-12-13 13:09:34,440 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 71 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2022-12-13 13:09:34,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 79 transitions, 431 flow [2022-12-13 13:09:34,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:09:34,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:09:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-13 13:09:34,441 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 13:09:34,441 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 136 flow. Second operand 4 states and 80 transitions. [2022-12-13 13:09:34,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 79 transitions, 431 flow [2022-12-13 13:09:34,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 79 transitions, 411 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 13:09:34,459 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 168 flow [2022-12-13 13:09:34,459 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2022-12-13 13:09:34,460 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-13 13:09:34,460 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:34,460 INFO L89 Accepts]: Start accepts. Operand has 43 places, 39 transitions, 168 flow [2022-12-13 13:09:34,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:34,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:34,461 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 39 transitions, 168 flow [2022-12-13 13:09:34,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 39 transitions, 168 flow [2022-12-13 13:09:34,472 INFO L130 PetriNetUnfolder]: 93/220 cut-off events. [2022-12-13 13:09:34,472 INFO L131 PetriNetUnfolder]: For 185/225 co-relation queries the response was YES. [2022-12-13 13:09:34,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 220 events. 93/220 cut-off events. For 185/225 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 850 event pairs, 10 based on Foata normal form. 6/192 useless extension candidates. Maximal degree in co-relation 360. Up to 103 conditions per place. [2022-12-13 13:09:34,474 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 39 transitions, 168 flow [2022-12-13 13:09:34,474 INFO L226 LiptonReduction]: Number of co-enabled transitions 496 [2022-12-13 13:09:34,476 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [458] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork3_#res.base_13| 0) (= |v_thread1Thread1of1ForFork3_#res.offset_13| 0) (not (< v_thread1Thread1of1ForFork3_~i~0_43 v_~N~0_79)) (= v_thread1Thread1of1ForFork3_~i~0_43 0)) InVars {~N~0=v_~N~0_79} OutVars{thread1Thread1of1ForFork3_#res.base=|v_thread1Thread1of1ForFork3_#res.base_13|, thread1Thread1of1ForFork3_#res.offset=|v_thread1Thread1of1ForFork3_#res.offset_13|, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_43, ~N~0=v_~N~0_79} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#res.base, thread1Thread1of1ForFork3_#res.offset, thread1Thread1of1ForFork3_~i~0] and [330] $Ultimate##0-->L51-4: 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-13 13:09:34,496 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:09:34,497 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 13:09:34,497 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 173 flow [2022-12-13 13:09:34,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 13:09:34,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:34,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:34,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:09:34,497 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:34,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:34,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1061862327, now seen corresponding path program 1 times [2022-12-13 13:09:34,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:34,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845669942] [2022-12-13 13:09:34,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:34,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:34,535 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-13 13:09:34,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:34,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845669942] [2022-12-13 13:09:34,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845669942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:34,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:34,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:09:34,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669879278] [2022-12-13 13:09:34,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:34,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:09:34,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:34,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:09:34,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:09:34,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 33 [2022-12-13 13:09:34,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:34,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:34,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 33 [2022-12-13 13:09:34,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:34,851 INFO L130 PetriNetUnfolder]: 3139/4216 cut-off events. [2022-12-13 13:09:34,851 INFO L131 PetriNetUnfolder]: For 4651/4985 co-relation queries the response was YES. [2022-12-13 13:09:34,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12200 conditions, 4216 events. 3139/4216 cut-off events. For 4651/4985 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 18634 event pairs, 1049 based on Foata normal form. 391/4508 useless extension candidates. Maximal degree in co-relation 7863. Up to 1850 conditions per place. [2022-12-13 13:09:34,869 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 72 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2022-12-13 13:09:34,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 462 flow [2022-12-13 13:09:34,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:09:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:09:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-13 13:09:34,870 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2022-12-13 13:09:34,870 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 173 flow. Second operand 4 states and 76 transitions. [2022-12-13 13:09:34,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 462 flow [2022-12-13 13:09:34,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 79 transitions, 448 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 13:09:34,878 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 178 flow [2022-12-13 13:09:34,878 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-13 13:09:34,879 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2022-12-13 13:09:34,879 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:34,879 INFO L89 Accepts]: Start accepts. Operand has 47 places, 40 transitions, 178 flow [2022-12-13 13:09:34,880 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:34,880 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:34,880 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 178 flow [2022-12-13 13:09:34,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 40 transitions, 178 flow [2022-12-13 13:09:34,892 INFO L130 PetriNetUnfolder]: 94/229 cut-off events. [2022-12-13 13:09:34,892 INFO L131 PetriNetUnfolder]: For 311/357 co-relation queries the response was YES. [2022-12-13 13:09:34,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 229 events. 94/229 cut-off events. For 311/357 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 891 event pairs, 6 based on Foata normal form. 8/201 useless extension candidates. Maximal degree in co-relation 424. Up to 109 conditions per place. [2022-12-13 13:09:34,894 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 40 transitions, 178 flow [2022-12-13 13:09:34,894 INFO L226 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-13 13:09:34,911 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:09:34,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 13:09:34,912 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 172 flow [2022-12-13 13:09:34,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:34,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:34,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:34,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:09:34,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:34,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:34,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1987224844, now seen corresponding path program 2 times [2022-12-13 13:09:34,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:34,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704839782] [2022-12-13 13:09:34,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:34,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:34,963 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-13 13:09:34,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:34,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704839782] [2022-12-13 13:09:34,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704839782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:34,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:34,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:09:34,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322097788] [2022-12-13 13:09:34,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:34,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:09:34,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:34,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:09:34,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:09:34,965 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 33 [2022-12-13 13:09:34,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 13:09:34,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:34,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 33 [2022-12-13 13:09:34,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:35,213 INFO L130 PetriNetUnfolder]: 2319/3100 cut-off events. [2022-12-13 13:09:35,213 INFO L131 PetriNetUnfolder]: For 5632/5641 co-relation queries the response was YES. [2022-12-13 13:09:35,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10021 conditions, 3100 events. 2319/3100 cut-off events. For 5632/5641 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 12597 event pairs, 543 based on Foata normal form. 127/3177 useless extension candidates. Maximal degree in co-relation 6429. Up to 1434 conditions per place. [2022-12-13 13:09:35,229 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 79 selfloop transitions, 9 changer transitions 0/90 dead transitions. [2022-12-13 13:09:35,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 90 transitions, 536 flow [2022-12-13 13:09:35,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:09:35,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:09:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-13 13:09:35,231 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2022-12-13 13:09:35,231 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 172 flow. Second operand 5 states and 94 transitions. [2022-12-13 13:09:35,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 90 transitions, 536 flow [2022-12-13 13:09:35,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 90 transitions, 511 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-13 13:09:35,238 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 232 flow [2022-12-13 13:09:35,239 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2022-12-13 13:09:35,240 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2022-12-13 13:09:35,241 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:35,241 INFO L89 Accepts]: Start accepts. Operand has 50 places, 43 transitions, 232 flow [2022-12-13 13:09:35,241 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:35,242 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:35,242 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 43 transitions, 232 flow [2022-12-13 13:09:35,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 43 transitions, 232 flow [2022-12-13 13:09:35,251 INFO L130 PetriNetUnfolder]: 76/177 cut-off events. [2022-12-13 13:09:35,251 INFO L131 PetriNetUnfolder]: For 551/648 co-relation queries the response was YES. [2022-12-13 13:09:35,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 177 events. 76/177 cut-off events. For 551/648 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 599 event pairs, 3 based on Foata normal form. 5/160 useless extension candidates. Maximal degree in co-relation 361. Up to 94 conditions per place. [2022-12-13 13:09:35,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 43 transitions, 232 flow [2022-12-13 13:09:35,253 INFO L226 LiptonReduction]: Number of co-enabled transitions 526 [2022-12-13 13:09:35,264 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork3_~i~0_45 1) (= v_~counter1~0_100 (+ v_~counter1~0_101 1)) (< v_thread1Thread1of1ForFork3_~i~0_45 (+ 1 v_~N~0_81))) InVars {~counter1~0=v_~counter1~0_101, ~N~0=v_~N~0_81} OutVars{thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_45, ~counter1~0=v_~counter1~0_100, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_21|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_17|, ~N~0=v_~N~0_81} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2] and [431] L51-4-->L51-4: Formula: (and (< |v_thread2Thread1of1ForFork1_~i~1#1_36| v_~N~0_53) (= (ite (< 0 v_~counter1~0_79) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (= (+ v_~counter1~0_78 1) v_~counter1~0_79) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_36|) |v_thread2Thread1of1ForFork1_~i~1#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter1~0=v_~counter1~0_79, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_36|, ~N~0=v_~N~0_53} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_15|, ~counter1~0=v_~counter1~0_78, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, ~counter1~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:09:35,314 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:09:35,315 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-13 13:09:35,315 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 238 flow [2022-12-13 13:09:35,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 13:09:35,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:35,315 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:35,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:09:35,316 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:35,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:35,316 INFO L85 PathProgramCache]: Analyzing trace with hash 868642671, now seen corresponding path program 2 times [2022-12-13 13:09:35,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:35,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697540163] [2022-12-13 13:09:35,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:35,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:35,361 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-13 13:09:35,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:35,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697540163] [2022-12-13 13:09:35,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697540163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:35,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:35,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:09:35,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274387321] [2022-12-13 13:09:35,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:35,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:09:35,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:35,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:09:35,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:09:35,362 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2022-12-13 13:09:35,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:35,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:35,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2022-12-13 13:09:35,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:35,668 INFO L130 PetriNetUnfolder]: 2857/3930 cut-off events. [2022-12-13 13:09:35,668 INFO L131 PetriNetUnfolder]: For 9480/9866 co-relation queries the response was YES. [2022-12-13 13:09:35,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12199 conditions, 3930 events. 2857/3930 cut-off events. For 9480/9866 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 18045 event pairs, 741 based on Foata normal form. 376/4234 useless extension candidates. Maximal degree in co-relation 7441. Up to 1773 conditions per place. [2022-12-13 13:09:35,683 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 104 selfloop transitions, 7 changer transitions 2/116 dead transitions. [2022-12-13 13:09:35,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 116 transitions, 809 flow [2022-12-13 13:09:35,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:09:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:09:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-13 13:09:35,685 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6294117647058823 [2022-12-13 13:09:35,685 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 238 flow. Second operand 5 states and 107 transitions. [2022-12-13 13:09:35,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 116 transitions, 809 flow [2022-12-13 13:09:35,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 116 transitions, 793 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-13 13:09:35,694 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 298 flow [2022-12-13 13:09:35,694 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2022-12-13 13:09:35,695 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2022-12-13 13:09:35,695 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:35,695 INFO L89 Accepts]: Start accepts. Operand has 56 places, 48 transitions, 298 flow [2022-12-13 13:09:35,697 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:35,697 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:35,697 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 48 transitions, 298 flow [2022-12-13 13:09:35,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 298 flow [2022-12-13 13:09:35,713 INFO L130 PetriNetUnfolder]: 97/252 cut-off events. [2022-12-13 13:09:35,713 INFO L131 PetriNetUnfolder]: For 733/845 co-relation queries the response was YES. [2022-12-13 13:09:35,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 252 events. 97/252 cut-off events. For 733/845 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1095 event pairs, 8 based on Foata normal form. 9/232 useless extension candidates. Maximal degree in co-relation 578. Up to 121 conditions per place. [2022-12-13 13:09:35,715 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 48 transitions, 298 flow [2022-12-13 13:09:35,716 INFO L226 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-13 13:09:35,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [458] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork3_#res.base_13| 0) (= |v_thread1Thread1of1ForFork3_#res.offset_13| 0) (not (< v_thread1Thread1of1ForFork3_~i~0_43 v_~N~0_79)) (= v_thread1Thread1of1ForFork3_~i~0_43 0)) InVars {~N~0=v_~N~0_79} OutVars{thread1Thread1of1ForFork3_#res.base=|v_thread1Thread1of1ForFork3_#res.base_13|, thread1Thread1of1ForFork3_#res.offset=|v_thread1Thread1of1ForFork3_#res.offset_13|, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_43, ~N~0=v_~N~0_79} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#res.base, thread1Thread1of1ForFork3_#res.offset, thread1Thread1of1ForFork3_~i~0] and [330] $Ultimate##0-->L51-4: 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-13 13:09:35,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [458] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork3_#res.base_13| 0) (= |v_thread1Thread1of1ForFork3_#res.offset_13| 0) (not (< v_thread1Thread1of1ForFork3_~i~0_43 v_~N~0_79)) (= v_thread1Thread1of1ForFork3_~i~0_43 0)) InVars {~N~0=v_~N~0_79} OutVars{thread1Thread1of1ForFork3_#res.base=|v_thread1Thread1of1ForFork3_#res.base_13|, thread1Thread1of1ForFork3_#res.offset=|v_thread1Thread1of1ForFork3_#res.offset_13|, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_43, ~N~0=v_~N~0_79} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#res.base, thread1Thread1of1ForFork3_#res.offset, thread1Thread1of1ForFork3_~i~0] and [330] $Ultimate##0-->L51-4: 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-13 13:09:35,769 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [464] $Ultimate##0-->L51-4: Formula: (and (not (< v_thread1Thread1of1ForFork3_~i~0_53 v_~N~0_91)) (= v_thread1Thread1of1ForFork3_~i~0_53 0) (= |v_thread1Thread1of1ForFork3_#res.base_17| 0) (= |v_thread1Thread1of1ForFork3_#res.offset_17| 0) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_51|)) InVars {~N~0=v_~N~0_91} OutVars{thread1Thread1of1ForFork3_#res.base=|v_thread1Thread1of1ForFork3_#res.base_17|, thread1Thread1of1ForFork3_#res.offset=|v_thread1Thread1of1ForFork3_#res.offset_17|, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_53, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_51|, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#res.base, thread1Thread1of1ForFork3_#res.offset, thread1Thread1of1ForFork3_~i~0, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:09:35,820 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:09:35,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 13:09:35,821 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 318 flow [2022-12-13 13:09:35,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:35,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:35,821 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:35,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:09:35,821 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:35,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:35,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1475927075, now seen corresponding path program 1 times [2022-12-13 13:09:35,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:35,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806506069] [2022-12-13 13:09:35,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:35,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:35,867 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-13 13:09:35,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:35,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806506069] [2022-12-13 13:09:35,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806506069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:35,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:35,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:09:35,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235646976] [2022-12-13 13:09:35,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:35,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:09:35,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:35,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:09:35,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:09:35,869 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 37 [2022-12-13 13:09:35,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-13 13:09:35,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:35,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 37 [2022-12-13 13:09:35,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:36,205 INFO L130 PetriNetUnfolder]: 3285/4511 cut-off events. [2022-12-13 13:09:36,205 INFO L131 PetriNetUnfolder]: For 14623/15026 co-relation queries the response was YES. [2022-12-13 13:09:36,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16024 conditions, 4511 events. 3285/4511 cut-off events. For 14623/15026 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 19850 event pairs, 1028 based on Foata normal form. 504/4972 useless extension candidates. Maximal degree in co-relation 10658. Up to 2466 conditions per place. [2022-12-13 13:09:36,226 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 87 selfloop transitions, 8 changer transitions 2/101 dead transitions. [2022-12-13 13:09:36,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 101 transitions, 816 flow [2022-12-13 13:09:36,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:09:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:09:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-13 13:09:36,227 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2022-12-13 13:09:36,227 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 318 flow. Second operand 4 states and 88 transitions. [2022-12-13 13:09:36,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 101 transitions, 816 flow [2022-12-13 13:09:36,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 101 transitions, 793 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 13:09:36,242 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 404 flow [2022-12-13 13:09:36,242 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=404, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2022-12-13 13:09:36,244 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2022-12-13 13:09:36,244 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:36,244 INFO L89 Accepts]: Start accepts. Operand has 61 places, 53 transitions, 404 flow [2022-12-13 13:09:36,246 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:36,246 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:36,246 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 53 transitions, 404 flow [2022-12-13 13:09:36,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 404 flow [2022-12-13 13:09:36,264 INFO L130 PetriNetUnfolder]: 125/344 cut-off events. [2022-12-13 13:09:36,264 INFO L131 PetriNetUnfolder]: For 1393/1582 co-relation queries the response was YES. [2022-12-13 13:09:36,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 344 events. 125/344 cut-off events. For 1393/1582 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1753 event pairs, 11 based on Foata normal form. 14/323 useless extension candidates. Maximal degree in co-relation 936. Up to 148 conditions per place. [2022-12-13 13:09:36,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 53 transitions, 404 flow [2022-12-13 13:09:36,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 684 [2022-12-13 13:09:36,309 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:09:36,311 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-13 13:09:36,311 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 398 flow [2022-12-13 13:09:36,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-13 13:09:36,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:36,312 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:36,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:09:36,312 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:36,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:36,312 INFO L85 PathProgramCache]: Analyzing trace with hash -712461283, now seen corresponding path program 1 times [2022-12-13 13:09:36,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:36,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231687301] [2022-12-13 13:09:36,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:36,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:36,372 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-13 13:09:36,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:36,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231687301] [2022-12-13 13:09:36,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231687301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:36,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:36,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:09:36,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634908055] [2022-12-13 13:09:36,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:36,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:09:36,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:36,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:09:36,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:09:36,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-13 13:09:36,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 398 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 13:09:36,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:36,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-13 13:09:36,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:36,648 INFO L130 PetriNetUnfolder]: 2958/4177 cut-off events. [2022-12-13 13:09:36,648 INFO L131 PetriNetUnfolder]: For 16795/17158 co-relation queries the response was YES. [2022-12-13 13:09:36,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16110 conditions, 4177 events. 2958/4177 cut-off events. For 16795/17158 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 19005 event pairs, 1103 based on Foata normal form. 344/4479 useless extension candidates. Maximal degree in co-relation 10194. Up to 2907 conditions per place. [2022-12-13 13:09:36,667 INFO L137 encePairwiseOnDemand]: 33/38 looper letters, 60 selfloop transitions, 3 changer transitions 18/85 dead transitions. [2022-12-13 13:09:36,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 673 flow [2022-12-13 13:09:36,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:09:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:09:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-13 13:09:36,668 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2022-12-13 13:09:36,668 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 398 flow. Second operand 4 states and 77 transitions. [2022-12-13 13:09:36,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 673 flow [2022-12-13 13:09:36,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 667 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:09:36,692 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 405 flow [2022-12-13 13:09:36,692 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=405, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2022-12-13 13:09:36,693 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 26 predicate places. [2022-12-13 13:09:36,693 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:36,693 INFO L89 Accepts]: Start accepts. Operand has 64 places, 52 transitions, 405 flow [2022-12-13 13:09:36,694 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:36,694 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:36,694 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 52 transitions, 405 flow [2022-12-13 13:09:36,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 52 transitions, 405 flow [2022-12-13 13:09:36,711 INFO L130 PetriNetUnfolder]: 124/345 cut-off events. [2022-12-13 13:09:36,711 INFO L131 PetriNetUnfolder]: For 1521/1706 co-relation queries the response was YES. [2022-12-13 13:09:36,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 345 events. 124/345 cut-off events. For 1521/1706 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1778 event pairs, 9 based on Foata normal form. 14/330 useless extension candidates. Maximal degree in co-relation 959. Up to 148 conditions per place. [2022-12-13 13:09:36,714 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 52 transitions, 405 flow [2022-12-13 13:09:36,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-13 13:09:36,715 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:09:36,715 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 13:09:36,715 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 405 flow [2022-12-13 13:09:36,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 13:09:36,715 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:36,715 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:36,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:09:36,716 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:36,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:36,716 INFO L85 PathProgramCache]: Analyzing trace with hash -113595917, now seen corresponding path program 2 times [2022-12-13 13:09:36,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:36,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111174749] [2022-12-13 13:09:36,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:36,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:36,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:36,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:36,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111174749] [2022-12-13 13:09:36,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111174749] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:09:36,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249988406] [2022-12-13 13:09:36,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:09:36,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:09:36,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:09:36,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:09:36,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:09:36,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:09:36,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:09:36,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 13:09:36,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:09:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:36,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:09:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:36,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249988406] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:09:36,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:09:36,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-12-13 13:09:36,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781546231] [2022-12-13 13:09:36,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:09:36,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:09:36,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:36,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:09:36,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:09:36,939 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-13 13:09:36,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 405 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:36,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:36,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-13 13:09:36,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:37,316 INFO L130 PetriNetUnfolder]: 3523/4863 cut-off events. [2022-12-13 13:09:37,316 INFO L131 PetriNetUnfolder]: For 18282/18655 co-relation queries the response was YES. [2022-12-13 13:09:37,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19163 conditions, 4863 events. 3523/4863 cut-off events. For 18282/18655 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 21707 event pairs, 570 based on Foata normal form. 486/5298 useless extension candidates. Maximal degree in co-relation 17288. Up to 2315 conditions per place. [2022-12-13 13:09:37,339 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 118 selfloop transitions, 13 changer transitions 12/147 dead transitions. [2022-12-13 13:09:37,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 147 transitions, 1300 flow [2022-12-13 13:09:37,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:09:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:09:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2022-12-13 13:09:37,341 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5570175438596491 [2022-12-13 13:09:37,341 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 405 flow. Second operand 6 states and 127 transitions. [2022-12-13 13:09:37,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 147 transitions, 1300 flow [2022-12-13 13:09:37,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 147 transitions, 1292 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 13:09:37,365 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 534 flow [2022-12-13 13:09:37,366 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=534, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2022-12-13 13:09:37,366 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2022-12-13 13:09:37,366 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:37,366 INFO L89 Accepts]: Start accepts. Operand has 68 places, 59 transitions, 534 flow [2022-12-13 13:09:37,367 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:37,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:37,367 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 59 transitions, 534 flow [2022-12-13 13:09:37,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 59 transitions, 534 flow [2022-12-13 13:09:37,388 INFO L130 PetriNetUnfolder]: 181/435 cut-off events. [2022-12-13 13:09:37,388 INFO L131 PetriNetUnfolder]: For 2064/2253 co-relation queries the response was YES. [2022-12-13 13:09:37,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1534 conditions, 435 events. 181/435 cut-off events. For 2064/2253 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2269 event pairs, 13 based on Foata normal form. 19/427 useless extension candidates. Maximal degree in co-relation 1393. Up to 235 conditions per place. [2022-12-13 13:09:37,392 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 59 transitions, 534 flow [2022-12-13 13:09:37,392 INFO L226 LiptonReduction]: Number of co-enabled transitions 652 [2022-12-13 13:09:37,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork3_~i~0_45 1) (= v_~counter1~0_100 (+ v_~counter1~0_101 1)) (< v_thread1Thread1of1ForFork3_~i~0_45 (+ 1 v_~N~0_81))) InVars {~counter1~0=v_~counter1~0_101, ~N~0=v_~N~0_81} OutVars{thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_45, ~counter1~0=v_~counter1~0_100, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_21|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_17|, ~N~0=v_~N~0_81} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2] and [436] L72-4-->L72-4: Formula: (and (= (+ v_~counter2~0_72 1) v_~counter2~0_73) (= (ite (< 0 v_~counter2~0_73) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= |v_thread4Thread1of1ForFork0_~i~3#1_27| (+ |v_thread4Thread1of1ForFork0_~i~3#1_28| 1)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (< |v_thread4Thread1of1ForFork0_~i~3#1_28| v_~N~0_61)) InVars {~counter2~0=v_~counter2~0_73, thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_28|, ~N~0=v_~N~0_61} OutVars{~counter2~0=v_~counter2~0_72, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_11|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_15|, thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_27|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~N~0=v_~N~0_61, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_#t~post7#1, thread4Thread1of1ForFork0_~i~3#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1] [2022-12-13 13:09:37,491 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:09:37,492 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 13:09:37,492 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 544 flow [2022-12-13 13:09:37,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:37,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:37,493 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:37,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 13:09:37,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 13:09:37,698 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash -739597785, now seen corresponding path program 3 times [2022-12-13 13:09:37,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:37,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788566273] [2022-12-13 13:09:37,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:37,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:37,751 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-13 13:09:37,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:37,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788566273] [2022-12-13 13:09:37,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788566273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:37,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:37,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:09:37,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779562717] [2022-12-13 13:09:37,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:37,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:09:37,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:37,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:09:37,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:09:37,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-13 13:09:37,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 544 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 13:09:37,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:37,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-13 13:09:37,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:38,038 INFO L130 PetriNetUnfolder]: 2955/4037 cut-off events. [2022-12-13 13:09:38,038 INFO L131 PetriNetUnfolder]: For 20091/20350 co-relation queries the response was YES. [2022-12-13 13:09:38,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17266 conditions, 4037 events. 2955/4037 cut-off events. For 20091/20350 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 16775 event pairs, 1290 based on Foata normal form. 272/4264 useless extension candidates. Maximal degree in co-relation 12093. Up to 3144 conditions per place. [2022-12-13 13:09:38,056 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 70 selfloop transitions, 4 changer transitions 31/107 dead transitions. [2022-12-13 13:09:38,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 107 transitions, 1121 flow [2022-12-13 13:09:38,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:09:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:09:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-13 13:09:38,058 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.55625 [2022-12-13 13:09:38,058 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 544 flow. Second operand 4 states and 89 transitions. [2022-12-13 13:09:38,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 107 transitions, 1121 flow [2022-12-13 13:09:38,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 107 transitions, 1086 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-13 13:09:38,088 INFO L231 Difference]: Finished difference. Result has 72 places, 53 transitions, 451 flow [2022-12-13 13:09:38,088 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=451, PETRI_PLACES=72, PETRI_TRANSITIONS=53} [2022-12-13 13:09:38,088 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 34 predicate places. [2022-12-13 13:09:38,089 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:38,089 INFO L89 Accepts]: Start accepts. Operand has 72 places, 53 transitions, 451 flow [2022-12-13 13:09:38,091 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:38,091 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:38,091 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 53 transitions, 451 flow [2022-12-13 13:09:38,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 53 transitions, 451 flow [2022-12-13 13:09:38,106 INFO L130 PetriNetUnfolder]: 141/285 cut-off events. [2022-12-13 13:09:38,106 INFO L131 PetriNetUnfolder]: For 1191/1257 co-relation queries the response was YES. [2022-12-13 13:09:38,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 285 events. 141/285 cut-off events. For 1191/1257 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1092 event pairs, 9 based on Foata normal form. 14/283 useless extension candidates. Maximal degree in co-relation 936. Up to 183 conditions per place. [2022-12-13 13:09:38,109 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 53 transitions, 451 flow [2022-12-13 13:09:38,109 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 13:09:38,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [330] $Ultimate##0-->L51-4: 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 [463] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ v_~counter1~0_110 1)) 1 0)) (< v_thread1Thread1of1ForFork3_~i~0_51 (+ 1 v_~N~0_89)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= v_thread1Thread1of1ForFork3_~i~0_51 1) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~N~0_89) (= v_~counter1~0_108 v_~counter1~0_110) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0))) InVars {~counter1~0=v_~counter1~0_110, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~N~0=v_~N~0_89} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_19|, ~counter1~0=v_~counter1~0_108, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_51, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_23|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_19|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_25|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~N~0=v_~N~0_89} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, ~counter1~0, thread1Thread1of1ForFork3_~i~0, thread1Thread1of1ForFork3_#t~post1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork3_#t~post2, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:09:38,198 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [330] $Ultimate##0-->L51-4: 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 [463] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ v_~counter1~0_110 1)) 1 0)) (< v_thread1Thread1of1ForFork3_~i~0_51 (+ 1 v_~N~0_89)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= v_thread1Thread1of1ForFork3_~i~0_51 1) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~N~0_89) (= v_~counter1~0_108 v_~counter1~0_110) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0))) InVars {~counter1~0=v_~counter1~0_110, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~N~0=v_~N~0_89} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_19|, ~counter1~0=v_~counter1~0_108, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_51, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_23|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_19|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_25|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~N~0=v_~N~0_89} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, ~counter1~0, thread1Thread1of1ForFork3_~i~0, thread1Thread1of1ForFork3_#t~post1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork3_#t~post2, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:09:38,304 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [330] $Ultimate##0-->L51-4: 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 [457] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork3_~i~0_39 1) (< v_thread1Thread1of1ForFork3_~i~0_39 (+ 1 v_~N~0_77)) (= (+ v_~counter1~0_97 1) v_~counter1~0_96)) InVars {~counter1~0=v_~counter1~0_97, ~N~0=v_~N~0_77} OutVars{thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_39, ~counter1~0=v_~counter1~0_96, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_19|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_15|, ~N~0=v_~N~0_77} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2] [2022-12-13 13:09:38,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [330] $Ultimate##0-->L51-4: 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 [457] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork3_~i~0_39 1) (< v_thread1Thread1of1ForFork3_~i~0_39 (+ 1 v_~N~0_77)) (= (+ v_~counter1~0_97 1) v_~counter1~0_96)) InVars {~counter1~0=v_~counter1~0_97, ~N~0=v_~N~0_77} OutVars{thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_39, ~counter1~0=v_~counter1~0_96, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_19|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_15|, ~N~0=v_~N~0_77} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2] [2022-12-13 13:09:38,407 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [350] $Ultimate##0-->L72-4: Formula: (= |v_thread4Thread1of1ForFork0_~i~3#1_1| 0) InVars {} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_~i~3#1] and [457] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork3_~i~0_39 1) (< v_thread1Thread1of1ForFork3_~i~0_39 (+ 1 v_~N~0_77)) (= (+ v_~counter1~0_97 1) v_~counter1~0_96)) InVars {~counter1~0=v_~counter1~0_97, ~N~0=v_~N~0_77} OutVars{thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_39, ~counter1~0=v_~counter1~0_96, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_19|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_15|, ~N~0=v_~N~0_77} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2] [2022-12-13 13:09:38,430 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [350] $Ultimate##0-->L72-4: Formula: (= |v_thread4Thread1of1ForFork0_~i~3#1_1| 0) InVars {} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_~i~3#1] and [467] $Ultimate##0-->L62-4: Formula: (and (= v_~counter2~0_100 (+ v_~counter2~0_101 1)) (= v_thread3Thread1of1ForFork2_~i~2_37 1) (< v_thread3Thread1of1ForFork2_~i~2_37 (+ 1 v_~N~0_97))) InVars {~counter2~0=v_~counter2~0_101, ~N~0=v_~N~0_97} OutVars{~counter2~0=v_~counter2~0_100, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_25|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_19|, ~N~0=v_~N~0_97, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_37} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork2_#t~post5, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2] [2022-12-13 13:09:38,453 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [350] $Ultimate##0-->L72-4: Formula: (= |v_thread4Thread1of1ForFork0_~i~3#1_1| 0) InVars {} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_~i~3#1] and [475] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork3_~i~0_66 1) (< v_thread1Thread1of1ForFork3_~i~0_66 (+ v_~N~0_113 1)) (= (+ v_~counter1~0_135 1) v_~counter1~0_134) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_74|)) InVars {~counter1~0=v_~counter1~0_135, ~N~0=v_~N~0_113} OutVars{thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_66, ~counter1~0=v_~counter1~0_134, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_31|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_27|, ~N~0=v_~N~0_113, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_74|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:09:38,489 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [350] $Ultimate##0-->L72-4: Formula: (= |v_thread4Thread1of1ForFork0_~i~3#1_1| 0) InVars {} OutVars{thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_~i~3#1] and [469] $Ultimate##0-->L72-4: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_18| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= |v_thread4Thread1of1ForFork0_~i~3#1_41| (+ |v_thread4Thread1of1ForFork0_~i~3#1_42| 1)) (= (+ v_~counter2~0_109 1) v_~counter2~0_110) (< |v_thread4Thread1of1ForFork0_~i~3#1_42| v_~N~0_101) (< v_thread1Thread1of1ForFork3_~i~0_60 (+ v_~N~0_101 1)) (= (+ v_~counter1~0_115 1) v_~counter1~0_114) (= v_thread1Thread1of1ForFork3_~i~0_60 1) (= (ite (< 0 v_~counter2~0_110) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_18| 0))) InVars {~counter2~0=v_~counter2~0_110, thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_42|, ~counter1~0=v_~counter1~0_115, ~N~0=v_~N~0_101} OutVars{~counter2~0=v_~counter2~0_109, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_18|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_22|, thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_41|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_60, ~counter1~0=v_~counter1~0_114, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_25|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_21|, ~N~0=v_~N~0_101, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_18|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_#t~post7#1, thread4Thread1of1ForFork0_~i~3#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1] [2022-12-13 13:09:38,580 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:09:38,581 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 492 [2022-12-13 13:09:38,581 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 508 flow [2022-12-13 13:09:38,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 13:09:38,581 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:38,581 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:38,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:09:38,581 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:38,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1759982551, now seen corresponding path program 1 times [2022-12-13 13:09:38,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:38,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628392353] [2022-12-13 13:09:38,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:38,614 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-13 13:09:38,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:38,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628392353] [2022-12-13 13:09:38,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628392353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:38,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:38,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:09:38,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446667222] [2022-12-13 13:09:38,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:38,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:09:38,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:38,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:09:38,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:09:38,616 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 45 [2022-12-13 13:09:38,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 508 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-13 13:09:38,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:38,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 45 [2022-12-13 13:09:38,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:38,899 INFO L130 PetriNetUnfolder]: 2330/3069 cut-off events. [2022-12-13 13:09:38,899 INFO L131 PetriNetUnfolder]: For 18781/19140 co-relation queries the response was YES. [2022-12-13 13:09:38,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13588 conditions, 3069 events. 2330/3069 cut-off events. For 18781/19140 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10739 event pairs, 686 based on Foata normal form. 272/3341 useless extension candidates. Maximal degree in co-relation 11287. Up to 2352 conditions per place. [2022-12-13 13:09:38,913 INFO L137 encePairwiseOnDemand]: 31/45 looper letters, 79 selfloop transitions, 16 changer transitions 1/98 dead transitions. [2022-12-13 13:09:38,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 98 transitions, 1203 flow [2022-12-13 13:09:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:09:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:09:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-13 13:09:38,914 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-13 13:09:38,914 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 508 flow. Second operand 4 states and 93 transitions. [2022-12-13 13:09:38,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 98 transitions, 1203 flow [2022-12-13 13:09:38,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 98 transitions, 921 flow, removed 106 selfloop flow, removed 14 redundant places. [2022-12-13 13:09:38,933 INFO L231 Difference]: Finished difference. Result has 56 places, 66 transitions, 615 flow [2022-12-13 13:09:38,933 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=615, PETRI_PLACES=56, PETRI_TRANSITIONS=66} [2022-12-13 13:09:38,934 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2022-12-13 13:09:38,934 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:38,934 INFO L89 Accepts]: Start accepts. Operand has 56 places, 66 transitions, 615 flow [2022-12-13 13:09:38,934 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:38,934 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:38,935 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 66 transitions, 615 flow [2022-12-13 13:09:38,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 66 transitions, 615 flow [2022-12-13 13:09:38,949 INFO L130 PetriNetUnfolder]: 156/307 cut-off events. [2022-12-13 13:09:38,949 INFO L131 PetriNetUnfolder]: For 978/1399 co-relation queries the response was YES. [2022-12-13 13:09:38,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 307 events. 156/307 cut-off events. For 978/1399 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1196 event pairs, 4 based on Foata normal form. 9/298 useless extension candidates. Maximal degree in co-relation 945. Up to 199 conditions per place. [2022-12-13 13:09:38,951 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 66 transitions, 615 flow [2022-12-13 13:09:38,951 INFO L226 LiptonReduction]: Number of co-enabled transitions 544 [2022-12-13 13:09:38,972 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [481] $Ultimate##0-->L72-4: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_24| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_24|) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_24| 0)) (= |v_thread4Thread1of1ForFork0_~i~3#1_59| 1) (= v_~counter1~0_150 (+ v_~counter1~0_151 1)) (< v_thread1Thread1of1ForFork3_~i~0_74 (+ v_~N~0_125 1)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_24| (ite (< 0 v_~counter2~0_126) 1 0)) (= (+ v_~counter2~0_125 1) v_~counter2~0_126) (= v_thread1Thread1of1ForFork3_~i~0_74 1)) InVars {~counter2~0=v_~counter2~0_126, ~counter1~0=v_~counter1~0_151, ~N~0=v_~N~0_125} OutVars{~counter2~0=v_~counter2~0_125, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_24|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_28|, thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_59|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_24|, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_74, ~counter1~0=v_~counter1~0_150, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_39|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_35|, ~N~0=v_~N~0_125, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_24|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_#t~post7#1, thread4Thread1of1ForFork0_~i~3#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1] and [442] L62-4-->L62-4: Formula: (and (= (+ v_~counter2~0_87 1) v_~counter2~0_86) (= v_thread3Thread1of1ForFork2_~i~2_27 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)) (< v_thread3Thread1of1ForFork2_~i~2_28 v_~N~0_65)) InVars {~counter2~0=v_~counter2~0_87, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_28} OutVars{~counter2~0=v_~counter2~0_86, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_19|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_15|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_27} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork2_#t~post5, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2] [2022-12-13 13:09:39,029 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [470] $Ultimate##0-->L72-4: Formula: (and (= |v_thread4Thread1of1ForFork0_~i~3#1_45| 1) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_20| (ite (< 0 v_~counter2~0_114) 1 0)) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_20| 0)) (= (+ v_~counter2~0_113 1) v_~counter2~0_114) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_20| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_20|) (< |v_thread4Thread1of1ForFork0_~i~3#1_45| (+ v_~N~0_103 1))) InVars {~counter2~0=v_~counter2~0_114, ~N~0=v_~N~0_103} OutVars{~counter2~0=v_~counter2~0_113, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_20|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_24|, thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_45|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_20|, ~N~0=v_~N~0_103, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_20|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_#t~post7#1, thread4Thread1of1ForFork0_~i~3#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1] and [442] L62-4-->L62-4: Formula: (and (= (+ v_~counter2~0_87 1) v_~counter2~0_86) (= v_thread3Thread1of1ForFork2_~i~2_27 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)) (< v_thread3Thread1of1ForFork2_~i~2_28 v_~N~0_65)) InVars {~counter2~0=v_~counter2~0_87, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_28} OutVars{~counter2~0=v_~counter2~0_86, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_19|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_15|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_27} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork2_#t~post5, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2] [2022-12-13 13:09:39,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork3_~i~0_45 1) (= v_~counter1~0_100 (+ v_~counter1~0_101 1)) (< v_thread1Thread1of1ForFork3_~i~0_45 (+ 1 v_~N~0_81))) InVars {~counter1~0=v_~counter1~0_101, ~N~0=v_~N~0_81} OutVars{thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_45, ~counter1~0=v_~counter1~0_100, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_21|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_17|, ~N~0=v_~N~0_81} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2] and [442] L62-4-->L62-4: Formula: (and (= (+ v_~counter2~0_87 1) v_~counter2~0_86) (= v_thread3Thread1of1ForFork2_~i~2_27 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)) (< v_thread3Thread1of1ForFork2_~i~2_28 v_~N~0_65)) InVars {~counter2~0=v_~counter2~0_87, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_28} OutVars{~counter2~0=v_~counter2~0_86, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_19|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_15|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_27} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork2_#t~post5, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2] [2022-12-13 13:09:39,106 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork3_~i~0_45 1) (= v_~counter1~0_100 (+ v_~counter1~0_101 1)) (< v_thread1Thread1of1ForFork3_~i~0_45 (+ 1 v_~N~0_81))) InVars {~counter1~0=v_~counter1~0_101, ~N~0=v_~N~0_81} OutVars{thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_45, ~counter1~0=v_~counter1~0_100, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_21|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_17|, ~N~0=v_~N~0_81} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2] and [442] L62-4-->L62-4: Formula: (and (= (+ v_~counter2~0_87 1) v_~counter2~0_86) (= v_thread3Thread1of1ForFork2_~i~2_27 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)) (< v_thread3Thread1of1ForFork2_~i~2_28 v_~N~0_65)) InVars {~counter2~0=v_~counter2~0_87, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_28} OutVars{~counter2~0=v_~counter2~0_86, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_19|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_15|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_27} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork2_#t~post5, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2] [2022-12-13 13:09:39,133 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] $Ultimate##0-->L51-4: Formula: (and (= v_~counter1~0_127 v_~counter1~0_126) (= (ite (< 0 (+ v_~counter1~0_127 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_66|) (< v_thread1Thread1of1ForFork3_~i~0_64 (+ v_~N~0_109 1)) (= v_thread1Thread1of1ForFork3_~i~0_64 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0))) InVars {~counter1~0=v_~counter1~0_127, ~N~0=v_~N~0_109} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, ~counter1~0=v_~counter1~0_126, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_64, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_29|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_25|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_31|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_66|, ~N~0=v_~N~0_109} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, ~counter1~0, thread1Thread1of1ForFork3_~i~0, thread1Thread1of1ForFork3_#t~post1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork3_#t~post2, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [442] L62-4-->L62-4: Formula: (and (= (+ v_~counter2~0_87 1) v_~counter2~0_86) (= v_thread3Thread1of1ForFork2_~i~2_27 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)) (< v_thread3Thread1of1ForFork2_~i~2_28 v_~N~0_65)) InVars {~counter2~0=v_~counter2~0_87, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_28} OutVars{~counter2~0=v_~counter2~0_86, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_19|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_15|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_27} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork2_#t~post5, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2] [2022-12-13 13:09:39,178 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork3_~i~0_45 1) (= v_~counter1~0_100 (+ v_~counter1~0_101 1)) (< v_thread1Thread1of1ForFork3_~i~0_45 (+ 1 v_~N~0_81))) InVars {~counter1~0=v_~counter1~0_101, ~N~0=v_~N~0_81} OutVars{thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_45, ~counter1~0=v_~counter1~0_100, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_21|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_17|, ~N~0=v_~N~0_81} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2] and [442] L62-4-->L62-4: Formula: (and (= (+ v_~counter2~0_87 1) v_~counter2~0_86) (= v_thread3Thread1of1ForFork2_~i~2_27 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)) (< v_thread3Thread1of1ForFork2_~i~2_28 v_~N~0_65)) InVars {~counter2~0=v_~counter2~0_87, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_28} OutVars{~counter2~0=v_~counter2~0_86, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_19|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_15|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_27} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork2_#t~post5, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2] [2022-12-13 13:09:39,202 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [472] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (ite (< 0 v_~counter1~0_123) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| (+ v_~N~0_107 1)) (= v_~counter1~0_123 (+ v_~counter1~0_122 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~counter1~0=v_~counter1~0_123, ~N~0=v_~N~0_107} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_23|, ~counter1~0=v_~counter1~0_122, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_29|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|, ~N~0=v_~N~0_107} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, ~counter1~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [442] L62-4-->L62-4: Formula: (and (= (+ v_~counter2~0_87 1) v_~counter2~0_86) (= v_thread3Thread1of1ForFork2_~i~2_27 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)) (< v_thread3Thread1of1ForFork2_~i~2_28 v_~N~0_65)) InVars {~counter2~0=v_~counter2~0_87, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_28} OutVars{~counter2~0=v_~counter2~0_86, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_19|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_15|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_27} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork2_#t~post5, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2] [2022-12-13 13:09:39,301 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [457] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork3_~i~0_39 1) (< v_thread1Thread1of1ForFork3_~i~0_39 (+ 1 v_~N~0_77)) (= (+ v_~counter1~0_97 1) v_~counter1~0_96)) InVars {~counter1~0=v_~counter1~0_97, ~N~0=v_~N~0_77} OutVars{thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_39, ~counter1~0=v_~counter1~0_96, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_19|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_15|, ~N~0=v_~N~0_77} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2] [2022-12-13 13:09:39,318 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [483] $Ultimate##0-->L62-4: Formula: (and (= (+ v_thread3Thread1of1ForFork2_~i~2_49 1) v_thread3Thread1of1ForFork2_~i~2_48) (= v_~counter2~0_133 v_~counter2~0_135) (= v_~counter1~0_154 (+ v_~counter1~0_155 1)) (= |v_thread4Thread1of1ForFork0_~i~3#1_63| 1) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_26| 0)) (< v_thread3Thread1of1ForFork2_~i~2_49 v_~N~0_129) (= v_thread1Thread1of1ForFork3_~i~0_76 1) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_26| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_26|) (< v_thread1Thread1of1ForFork3_~i~0_76 (+ v_~N~0_129 1)) (= (ite (< 0 v_~counter2~0_135) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_26|)) InVars {~counter2~0=v_~counter2~0_135, ~counter1~0=v_~counter1~0_155, ~N~0=v_~N~0_129, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_49} OutVars{thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_30|, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_76, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_41|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_37|, ~N~0=v_~N~0_129, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_48, ~counter2~0=v_~counter2~0_133, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_26|, thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_63|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_26|, ~counter1~0=v_~counter1~0_154, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_31|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_25|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_26|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#t~post7#1, thread1Thread1of1ForFork3_~i~0, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2, thread3Thread1of1ForFork2_~i~2, ~counter2~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_~i~3#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~counter1~0, thread3Thread1of1ForFork2_#t~post5, thread3Thread1of1ForFork2_#t~post6, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1] [2022-12-13 13:09:39,399 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [484] $Ultimate##0-->L62-4: Formula: (and (< v_thread3Thread1of1ForFork2_~i~2_53 v_~N~0_131) (< |v_thread4Thread1of1ForFork0_~i~3#1_65| (+ v_~N~0_131 1)) (= |v_thread4Thread1of1ForFork0_~i~3#1_65| 1) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_28| 0)) (= v_thread3Thread1of1ForFork2_~i~2_52 (+ v_thread3Thread1of1ForFork2_~i~2_53 1)) (= (ite (< 0 v_~counter2~0_141) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_28|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_28| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_28|) (= v_~counter2~0_141 v_~counter2~0_139)) InVars {~counter2~0=v_~counter2~0_141, ~N~0=v_~N~0_131, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_53} OutVars{~counter2~0=v_~counter2~0_139, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_28|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_32|, thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_65|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_28|, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_33|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_27|, ~N~0=v_~N~0_131, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_28|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_52} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_#t~post7#1, thread4Thread1of1ForFork0_~i~3#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~post5, thread3Thread1of1ForFork2_#t~post6, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_~i~2] [2022-12-13 13:09:39,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [480] $Ultimate##0-->L41-4: Formula: (and (= |v_thread4Thread1of1ForFork0_~i~3#1_57| 0) (= v_thread1Thread1of1ForFork3_~i~0_72 1) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_78|) (= v_~counter1~0_146 (+ v_~counter1~0_147 1)) (< v_thread1Thread1of1ForFork3_~i~0_72 (+ v_~N~0_123 1))) InVars {~counter1~0=v_~counter1~0_147, ~N~0=v_~N~0_123} OutVars{thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_72, ~counter1~0=v_~counter1~0_146, thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_57|, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_37|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_33|, ~N~0=v_~N~0_123, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_78|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread4Thread1of1ForFork0_~i~3#1, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:09:39,480 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [485] $Ultimate##0-->L62-4: Formula: (and (< v_thread1Thread1of1ForFork3_~i~0_78 (+ v_~N~0_133 1)) (= v_thread3Thread1of1ForFork2_~i~2_56 (+ v_thread3Thread1of1ForFork2_~i~2_57 1)) (= v_~counter2~0_145 (+ v_~counter2~0_146 1)) (= v_thread1Thread1of1ForFork3_~i~0_78 1) (< v_thread3Thread1of1ForFork2_~i~2_57 v_~N~0_133) (= v_~counter1~0_158 (+ v_~counter1~0_159 1))) InVars {~counter2~0=v_~counter2~0_146, ~counter1~0=v_~counter1~0_159, ~N~0=v_~N~0_133, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_57} OutVars{~counter2~0=v_~counter2~0_145, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_78, ~counter1~0=v_~counter1~0_158, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_35|, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_43|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_39|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_29|, ~N~0=v_~N~0_133, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_56} AuxVars[] AssignedVars[~counter2~0, thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread3Thread1of1ForFork2_#t~post5, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2] [2022-12-13 13:09:39,519 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [486] $Ultimate##0-->L62-4: Formula: (and (< v_thread3Thread1of1ForFork2_~i~2_61 v_~N~0_135) (= v_thread1Thread1of1ForFork3_~i~0_80 1) (= v_thread3Thread1of1ForFork2_~i~2_60 (+ v_thread3Thread1of1ForFork2_~i~2_61 1)) (= (+ v_~counter2~0_150 1) v_~counter2~0_149) (= v_~counter1~0_162 (+ v_~counter1~0_163 1)) (< v_thread1Thread1of1ForFork3_~i~0_80 (+ v_~N~0_135 1))) InVars {~counter2~0=v_~counter2~0_150, ~counter1~0=v_~counter1~0_163, ~N~0=v_~N~0_135, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_61} OutVars{~counter2~0=v_~counter2~0_149, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_80, ~counter1~0=v_~counter1~0_162, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_37|, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_45|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_41|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_31|, ~N~0=v_~N~0_135, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_60} AuxVars[] AssignedVars[~counter2~0, thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread3Thread1of1ForFork2_#t~post5, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2] [2022-12-13 13:09:39,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [478] $Ultimate##0-->L41-4: Formula: (and (= |v_thread4Thread1of1ForFork0_~i~3#1_53| 0) (= v_~counter1~0_142 (+ v_~counter1~0_143 1)) (= v_thread1Thread1of1ForFork3_~i~0_70 1) (< v_thread1Thread1of1ForFork3_~i~0_70 (+ v_~N~0_119 1))) InVars {~counter1~0=v_~counter1~0_143, ~N~0=v_~N~0_119} OutVars{thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_70, ~counter1~0=v_~counter1~0_142, thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_53|, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_35|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_31|, ~N~0=v_~N~0_119} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread4Thread1of1ForFork0_~i~3#1, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2] [2022-12-13 13:09:39,579 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [487] $Ultimate##0-->L62-4: Formula: (and (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_80|) (= v_thread3Thread1of1ForFork2_~i~2_64 (+ v_thread3Thread1of1ForFork2_~i~2_65 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_29| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_29| 0)) (< v_thread3Thread1of1ForFork2_~i~2_65 v_~N~0_137) (= v_~counter1~0_167 v_~counter1~0_166) (= (+ v_~counter2~0_154 1) v_~counter2~0_153) (= (ite (< 0 (+ v_~counter1~0_167 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|) (< v_thread1Thread1of1ForFork3_~i~0_82 (+ v_~N~0_137 1)) (= v_thread1Thread1of1ForFork3_~i~0_82 1)) InVars {~counter2~0=v_~counter2~0_154, ~counter1~0=v_~counter1~0_167, ~N~0=v_~N~0_137, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_82, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_43|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_35|, ~N~0=v_~N~0_137, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_80|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_64, ~counter2~0=v_~counter2~0_153, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_29|, ~counter1~0=v_~counter1~0_166, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_39|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork3_~i~0, thread1Thread1of1ForFork3_#t~post1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork3_#t~post2, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1, thread3Thread1of1ForFork2_~i~2, ~counter2~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter1~0, thread3Thread1of1ForFork2_#t~post5, thread3Thread1of1ForFork2_#t~post6] [2022-12-13 13:09:39,651 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [474] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 v_~counter1~0_131) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (< 0 v_~N~0_111) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_70|) (= v_~counter1~0_131 (+ v_~counter1~0_130 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|)) InVars {~counter1~0=v_~counter1~0_131, ~N~0=v_~N~0_111} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_27|, ~counter1~0=v_~counter1~0_130, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_70|, ~N~0=v_~N~0_111} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, ~counter1~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:09:39,685 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [488] $Ultimate##0-->L62-4: Formula: (and (< v_thread3Thread1of1ForFork2_~i~2_69 v_~N~0_139) (= v_thread3Thread1of1ForFork2_~i~2_68 (+ v_thread3Thread1of1ForFork2_~i~2_69 1)) (< v_thread1Thread1of1ForFork3_~i~0_84 (+ v_~N~0_139 1)) (= v_~counter2~0_157 (+ v_~counter2~0_158 1)) (= v_thread1Thread1of1ForFork3_~i~0_84 1) (= v_~counter1~0_170 (+ v_~counter1~0_171 1))) InVars {~counter2~0=v_~counter2~0_158, ~counter1~0=v_~counter1~0_171, ~N~0=v_~N~0_139, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_69} OutVars{~counter2~0=v_~counter2~0_157, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_84, ~counter1~0=v_~counter1~0_170, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_41|, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_49|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_45|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_35|, ~N~0=v_~N~0_139, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_68} AuxVars[] AssignedVars[~counter2~0, thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread3Thread1of1ForFork2_#t~post5, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2] [2022-12-13 13:09:39,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [477] $Ultimate##0-->L72-4: Formula: (and (= v_~counter2~0_118 (+ v_~counter2~0_117 1)) (< |v_thread4Thread1of1ForFork0_~i~3#1_49| (+ v_~N~0_117 1)) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_22| 0)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_22| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_22|) (= (ite (< 0 v_~counter2~0_118) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_22|) (= |v_thread4Thread1of1ForFork0_~i~3#1_49| 1)) InVars {~counter2~0=v_~counter2~0_118, ~N~0=v_~N~0_117} OutVars{~counter2~0=v_~counter2~0_117, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_22|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_26|, thread4Thread1of1ForFork0_~i~3#1=|v_thread4Thread1of1ForFork0_~i~3#1_49|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_22|, ~N~0=v_~N~0_117, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_22|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_#t~post7#1, thread4Thread1of1ForFork0_~i~3#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1] [2022-12-13 13:09:39,758 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [489] $Ultimate##0-->L62-4: Formula: (and (= (ite (< 0 v_~counter1~0_175) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_31|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_82|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_31| 0)) (= v_thread3Thread1of1ForFork2_~i~2_72 (+ v_thread3Thread1of1ForFork2_~i~2_73 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_82| (+ v_~N~0_141 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_31| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~counter1~0_174 1) v_~counter1~0_175) (= (+ v_~counter2~0_162 1) v_~counter2~0_161) (< v_thread3Thread1of1ForFork2_~i~2_73 v_~N~0_141)) InVars {~counter2~0=v_~counter2~0_162, ~counter1~0=v_~counter1~0_175, ~N~0=v_~N~0_141, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_73} OutVars{~counter2~0=v_~counter2~0_161, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_31|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~counter1~0=v_~counter1~0_174, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_43|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_31|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_37|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_37|, ~N~0=v_~N~0_141, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_82|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_72} AuxVars[] AssignedVars[~counter2~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, ~counter1~0, thread3Thread1of1ForFork2_#t~post5, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6, thread2Thread1of1ForFork1_~i~1#1, thread3Thread1of1ForFork2_~i~2] [2022-12-13 13:09:39,824 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [476] $Ultimate##0-->L41-4: Formula: (and (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_76|) (< v_thread1Thread1of1ForFork3_~i~0_68 (+ v_~N~0_115 1)) (= v_thread1Thread1of1ForFork3_~i~0_68 1) (= v_~counter1~0_138 (+ v_~counter1~0_139 1))) InVars {~counter1~0=v_~counter1~0_139, ~N~0=v_~N~0_115} OutVars{thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_68, ~counter1~0=v_~counter1~0_138, thread1Thread1of1ForFork3_#t~post1=|v_thread1Thread1of1ForFork3_#t~post1_33|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_29|, ~N~0=v_~N~0_115, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_76|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_~i~0, ~counter1~0, thread1Thread1of1ForFork3_#t~post1, thread1Thread1of1ForFork3_#t~post2, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:09:39,847 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:09:39,848 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 914 [2022-12-13 13:09:39,848 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 66 transitions, 693 flow [2022-12-13 13:09:39,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-13 13:09:39,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:39,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:39,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:09:39,848 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:39,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:39,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1304333165, now seen corresponding path program 1 times [2022-12-13 13:09:39,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:39,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492565672] [2022-12-13 13:09:39,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:39,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:39,925 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-13 13:09:39,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:39,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492565672] [2022-12-13 13:09:39,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492565672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:39,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:39,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:09:39,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510958784] [2022-12-13 13:09:39,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:39,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:09:39,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:39,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:09:39,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:09:39,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 59 [2022-12-13 13:09:39,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 66 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-13 13:09:39,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:39,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 59 [2022-12-13 13:09:39,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:40,157 INFO L130 PetriNetUnfolder]: 2256/3009 cut-off events. [2022-12-13 13:09:40,157 INFO L131 PetriNetUnfolder]: For 7800/7928 co-relation queries the response was YES. [2022-12-13 13:09:40,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10754 conditions, 3009 events. 2256/3009 cut-off events. For 7800/7928 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10885 event pairs, 686 based on Foata normal form. 216/3225 useless extension candidates. Maximal degree in co-relation 6239. Up to 2217 conditions per place. [2022-12-13 13:09:40,168 INFO L137 encePairwiseOnDemand]: 42/59 looper letters, 63 selfloop transitions, 13 changer transitions 1/79 dead transitions. [2022-12-13 13:09:40,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 79 transitions, 728 flow [2022-12-13 13:09:40,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:09:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:09:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-13 13:09:40,170 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4745762711864407 [2022-12-13 13:09:40,170 INFO L175 Difference]: Start difference. First operand has 55 places, 66 transitions, 693 flow. Second operand 3 states and 84 transitions. [2022-12-13 13:09:40,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 79 transitions, 728 flow [2022-12-13 13:09:40,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 666 flow, removed 23 selfloop flow, removed 3 redundant places. [2022-12-13 13:09:40,177 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 468 flow [2022-12-13 13:09:40,177 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2022-12-13 13:09:40,178 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2022-12-13 13:09:40,178 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:40,178 INFO L89 Accepts]: Start accepts. Operand has 55 places, 53 transitions, 468 flow [2022-12-13 13:09:40,178 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:40,179 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:40,179 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 53 transitions, 468 flow [2022-12-13 13:09:40,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 53 transitions, 468 flow [2022-12-13 13:09:40,195 INFO L130 PetriNetUnfolder]: 123/296 cut-off events. [2022-12-13 13:09:40,195 INFO L131 PetriNetUnfolder]: For 660/785 co-relation queries the response was YES. [2022-12-13 13:09:40,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 296 events. 123/296 cut-off events. For 660/785 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1355 event pairs, 5 based on Foata normal form. 5/284 useless extension candidates. Maximal degree in co-relation 723. Up to 162 conditions per place. [2022-12-13 13:09:40,197 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 53 transitions, 468 flow [2022-12-13 13:09:40,197 INFO L226 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-13 13:09:40,198 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:09:40,199 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 13:09:40,199 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 468 flow [2022-12-13 13:09:40,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-13 13:09:40,199 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:40,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:40,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:09:40,202 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:40,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:40,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1688466748, now seen corresponding path program 1 times [2022-12-13 13:09:40,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:40,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599648731] [2022-12-13 13:09:40,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:40,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:40,269 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-13 13:09:40,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:40,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599648731] [2022-12-13 13:09:40,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599648731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:40,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:40,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:09:40,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179553925] [2022-12-13 13:09:40,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:40,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:09:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:40,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:09:40,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:09:40,272 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 48 [2022-12-13 13:09:40,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-13 13:09:40,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:40,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 48 [2022-12-13 13:09:40,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:40,420 INFO L130 PetriNetUnfolder]: 1596/2171 cut-off events. [2022-12-13 13:09:40,421 INFO L131 PetriNetUnfolder]: For 4351/4400 co-relation queries the response was YES. [2022-12-13 13:09:40,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7606 conditions, 2171 events. 1596/2171 cut-off events. For 4351/4400 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7549 event pairs, 348 based on Foata normal form. 135/2306 useless extension candidates. Maximal degree in co-relation 4573. Up to 1747 conditions per place. [2022-12-13 13:09:40,429 INFO L137 encePairwiseOnDemand]: 39/48 looper letters, 52 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2022-12-13 13:09:40,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 534 flow [2022-12-13 13:09:40,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:09:40,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:09:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 13:09:40,430 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-13 13:09:40,430 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 468 flow. Second operand 3 states and 63 transitions. [2022-12-13 13:09:40,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 534 flow [2022-12-13 13:09:40,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 503 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 13:09:40,435 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 353 flow [2022-12-13 13:09:40,435 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-13 13:09:40,436 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2022-12-13 13:09:40,436 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:40,436 INFO L89 Accepts]: Start accepts. Operand has 54 places, 45 transitions, 353 flow [2022-12-13 13:09:40,436 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:40,436 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:40,437 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 353 flow [2022-12-13 13:09:40,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 353 flow [2022-12-13 13:09:40,445 INFO L130 PetriNetUnfolder]: 76/199 cut-off events. [2022-12-13 13:09:40,446 INFO L131 PetriNetUnfolder]: For 362/440 co-relation queries the response was YES. [2022-12-13 13:09:40,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 199 events. 76/199 cut-off events. For 362/440 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 765 event pairs, 4 based on Foata normal form. 1/190 useless extension candidates. Maximal degree in co-relation 492. Up to 104 conditions per place. [2022-12-13 13:09:40,447 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 353 flow [2022-12-13 13:09:40,447 INFO L226 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-13 13:09:40,447 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:09:40,448 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 13:09:40,448 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 353 flow [2022-12-13 13:09:40,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-13 13:09:40,448 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:40,449 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:40,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:09:40,449 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:40,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:40,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2116222578, now seen corresponding path program 1 times [2022-12-13 13:09:40,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:40,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477911744] [2022-12-13 13:09:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:40,591 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-13 13:09:40,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:40,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477911744] [2022-12-13 13:09:40,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477911744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:40,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:40,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:09:40,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406259205] [2022-12-13 13:09:40,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:40,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:09:40,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:40,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:09:40,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:09:40,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-13 13:09:40,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-13 13:09:40,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:40,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-13 13:09:40,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:40,937 INFO L130 PetriNetUnfolder]: 3384/4572 cut-off events. [2022-12-13 13:09:40,938 INFO L131 PetriNetUnfolder]: For 8124/8177 co-relation queries the response was YES. [2022-12-13 13:09:40,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16285 conditions, 4572 events. 3384/4572 cut-off events. For 8124/8177 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 18300 event pairs, 785 based on Foata normal form. 55/4627 useless extension candidates. Maximal degree in co-relation 10459. Up to 2677 conditions per place. [2022-12-13 13:09:40,954 INFO L137 encePairwiseOnDemand]: 22/41 looper letters, 70 selfloop transitions, 29 changer transitions 1/101 dead transitions. [2022-12-13 13:09:40,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 101 transitions, 808 flow [2022-12-13 13:09:40,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:09:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:09:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-13 13:09:40,955 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47804878048780486 [2022-12-13 13:09:40,955 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 353 flow. Second operand 5 states and 98 transitions. [2022-12-13 13:09:40,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 101 transitions, 808 flow [2022-12-13 13:09:40,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 101 transitions, 778 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-13 13:09:40,965 INFO L231 Difference]: Finished difference. Result has 55 places, 63 transitions, 548 flow [2022-12-13 13:09:40,965 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=548, PETRI_PLACES=55, PETRI_TRANSITIONS=63} [2022-12-13 13:09:40,966 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2022-12-13 13:09:40,966 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:40,966 INFO L89 Accepts]: Start accepts. Operand has 55 places, 63 transitions, 548 flow [2022-12-13 13:09:40,967 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:40,967 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:40,967 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 63 transitions, 548 flow [2022-12-13 13:09:40,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 63 transitions, 548 flow [2022-12-13 13:09:40,982 INFO L130 PetriNetUnfolder]: 132/337 cut-off events. [2022-12-13 13:09:40,982 INFO L131 PetriNetUnfolder]: For 578/720 co-relation queries the response was YES. [2022-12-13 13:09:40,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 337 events. 132/337 cut-off events. For 578/720 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1605 event pairs, 9 based on Foata normal form. 1/324 useless extension candidates. Maximal degree in co-relation 964. Up to 180 conditions per place. [2022-12-13 13:09:40,985 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 63 transitions, 548 flow [2022-12-13 13:09:40,985 INFO L226 LiptonReduction]: Number of co-enabled transitions 670 [2022-12-13 13:09:40,985 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:09:40,986 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 13:09:40,986 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 63 transitions, 548 flow [2022-12-13 13:09:40,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-13 13:09:40,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:40,986 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:40,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:09:40,988 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:40,988 INFO L85 PathProgramCache]: Analyzing trace with hash 624590151, now seen corresponding path program 1 times [2022-12-13 13:09:40,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:40,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975064143] [2022-12-13 13:09:40,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:40,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:41,125 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-13 13:09:41,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:41,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975064143] [2022-12-13 13:09:41,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975064143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:41,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:41,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:09:41,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116211460] [2022-12-13 13:09:41,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:41,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:09:41,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:41,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:09:41,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:09:41,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-13 13:09:41,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 63 transitions, 548 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 13:09:41,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:41,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-13 13:09:41,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:41,738 INFO L130 PetriNetUnfolder]: 6996/9458 cut-off events. [2022-12-13 13:09:41,738 INFO L131 PetriNetUnfolder]: For 22545/22622 co-relation queries the response was YES. [2022-12-13 13:09:41,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37313 conditions, 9458 events. 6996/9458 cut-off events. For 22545/22622 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 43739 event pairs, 1036 based on Foata normal form. 79/9537 useless extension candidates. Maximal degree in co-relation 23153. Up to 4717 conditions per place. [2022-12-13 13:09:41,785 INFO L137 encePairwiseOnDemand]: 21/41 looper letters, 89 selfloop transitions, 65 changer transitions 1/156 dead transitions. [2022-12-13 13:09:41,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 156 transitions, 1350 flow [2022-12-13 13:09:41,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:09:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:09:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-12-13 13:09:41,786 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6195121951219512 [2022-12-13 13:09:41,787 INFO L175 Difference]: Start difference. First operand has 55 places, 63 transitions, 548 flow. Second operand 5 states and 127 transitions. [2022-12-13 13:09:41,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 156 transitions, 1350 flow [2022-12-13 13:09:41,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 156 transitions, 1313 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 13:09:41,801 INFO L231 Difference]: Finished difference. Result has 58 places, 99 transitions, 1023 flow [2022-12-13 13:09:41,802 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1023, PETRI_PLACES=58, PETRI_TRANSITIONS=99} [2022-12-13 13:09:41,802 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2022-12-13 13:09:41,803 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:41,803 INFO L89 Accepts]: Start accepts. Operand has 58 places, 99 transitions, 1023 flow [2022-12-13 13:09:41,805 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:41,805 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:41,805 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 99 transitions, 1023 flow [2022-12-13 13:09:41,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 99 transitions, 1023 flow [2022-12-13 13:09:41,837 INFO L130 PetriNetUnfolder]: 268/679 cut-off events. [2022-12-13 13:09:41,838 INFO L131 PetriNetUnfolder]: For 819/1457 co-relation queries the response was YES. [2022-12-13 13:09:41,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 679 events. 268/679 cut-off events. For 819/1457 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4076 event pairs, 14 based on Foata normal form. 4/655 useless extension candidates. Maximal degree in co-relation 2285. Up to 369 conditions per place. [2022-12-13 13:09:41,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 99 transitions, 1023 flow [2022-12-13 13:09:41,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 1288 [2022-12-13 13:09:41,844 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:09:41,844 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 13:09:41,844 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 99 transitions, 1023 flow [2022-12-13 13:09:41,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 13:09:41,844 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:41,844 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:41,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 13:09:41,844 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:41,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:41,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2023204850, now seen corresponding path program 1 times [2022-12-13 13:09:41,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:41,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927042968] [2022-12-13 13:09:41,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:41,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:41,886 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-13 13:09:41,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:41,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927042968] [2022-12-13 13:09:41,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927042968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:41,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:41,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:09:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930108348] [2022-12-13 13:09:41,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:41,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:09:41,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:41,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:09:41,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:09:41,888 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-13 13:09:41,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 99 transitions, 1023 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 13:09:41,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:41,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-13 13:09:41,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:43,357 INFO L130 PetriNetUnfolder]: 16312/22174 cut-off events. [2022-12-13 13:09:43,358 INFO L131 PetriNetUnfolder]: For 97296/97397 co-relation queries the response was YES. [2022-12-13 13:09:43,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99743 conditions, 22174 events. 16312/22174 cut-off events. For 97296/97397 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 118460 event pairs, 1306 based on Foata normal form. 283/22457 useless extension candidates. Maximal degree in co-relation 62233. Up to 10661 conditions per place. [2022-12-13 13:09:43,520 INFO L137 encePairwiseOnDemand]: 26/41 looper letters, 331 selfloop transitions, 66 changer transitions 0/398 dead transitions. [2022-12-13 13:09:43,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 398 transitions, 4595 flow [2022-12-13 13:09:43,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:09:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:09:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2022-12-13 13:09:43,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2022-12-13 13:09:43,522 INFO L175 Difference]: Start difference. First operand has 58 places, 99 transitions, 1023 flow. Second operand 8 states and 151 transitions. [2022-12-13 13:09:43,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 398 transitions, 4595 flow [2022-12-13 13:09:43,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 398 transitions, 4336 flow, removed 100 selfloop flow, removed 1 redundant places. [2022-12-13 13:09:43,602 INFO L231 Difference]: Finished difference. Result has 68 places, 157 transitions, 1807 flow [2022-12-13 13:09:43,602 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1807, PETRI_PLACES=68, PETRI_TRANSITIONS=157} [2022-12-13 13:09:43,602 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2022-12-13 13:09:43,602 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:43,602 INFO L89 Accepts]: Start accepts. Operand has 68 places, 157 transitions, 1807 flow [2022-12-13 13:09:43,603 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:43,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:43,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 157 transitions, 1807 flow [2022-12-13 13:09:43,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 157 transitions, 1807 flow [2022-12-13 13:09:43,704 INFO L130 PetriNetUnfolder]: 848/2019 cut-off events. [2022-12-13 13:09:43,704 INFO L131 PetriNetUnfolder]: For 4414/5289 co-relation queries the response was YES. [2022-12-13 13:09:43,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7943 conditions, 2019 events. 848/2019 cut-off events. For 4414/5289 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 15610 event pairs, 28 based on Foata normal form. 4/1964 useless extension candidates. Maximal degree in co-relation 7290. Up to 1061 conditions per place. [2022-12-13 13:09:43,721 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 157 transitions, 1807 flow [2022-12-13 13:09:43,721 INFO L226 LiptonReduction]: Number of co-enabled transitions 2154 [2022-12-13 13:09:43,726 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:09:43,726 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 13:09:43,726 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 157 transitions, 1807 flow [2022-12-13 13:09:43,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 13:09:43,727 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:43,727 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:43,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:09:43,727 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:43,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:43,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1763691842, now seen corresponding path program 1 times [2022-12-13 13:09:43,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:43,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539927792] [2022-12-13 13:09:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:43,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:43,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:43,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539927792] [2022-12-13 13:09:43,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539927792] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:09:43,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941094057] [2022-12-13 13:09:43,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:43,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:09:43,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:09:43,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:09:43,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:09:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:43,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 13:09:43,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:09:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:43,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:09:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:43,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941094057] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:09:43,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:09:43,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-13 13:09:43,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451679635] [2022-12-13 13:09:43,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:09:43,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:09:43,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:43,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:09:43,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:09:43,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-13 13:09:43,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 157 transitions, 1807 flow. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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-13 13:09:43,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:43,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-13 13:09:43,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:46,626 INFO L130 PetriNetUnfolder]: 26622/36056 cut-off events. [2022-12-13 13:09:46,626 INFO L131 PetriNetUnfolder]: For 166198/166299 co-relation queries the response was YES. [2022-12-13 13:09:46,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172042 conditions, 36056 events. 26622/36056 cut-off events. For 166198/166299 co-relation queries the response was YES. Maximal size of possible extension queue 1383. Compared 199883 event pairs, 6322 based on Foata normal form. 413/36469 useless extension candidates. Maximal degree in co-relation 98806. Up to 17617 conditions per place. [2022-12-13 13:09:46,814 INFO L137 encePairwiseOnDemand]: 33/41 looper letters, 272 selfloop transitions, 70 changer transitions 0/343 dead transitions. [2022-12-13 13:09:46,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 343 transitions, 4217 flow [2022-12-13 13:09:46,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:09:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:09:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-13 13:09:46,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.526829268292683 [2022-12-13 13:09:46,816 INFO L175 Difference]: Start difference. First operand has 68 places, 157 transitions, 1807 flow. Second operand 5 states and 108 transitions. [2022-12-13 13:09:46,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 343 transitions, 4217 flow [2022-12-13 13:09:47,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 343 transitions, 4193 flow, removed 12 selfloop flow, removed 0 redundant places. [2022-12-13 13:09:47,091 INFO L231 Difference]: Finished difference. Result has 74 places, 199 transitions, 2585 flow [2022-12-13 13:09:47,091 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1783, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2585, PETRI_PLACES=74, PETRI_TRANSITIONS=199} [2022-12-13 13:09:47,092 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2022-12-13 13:09:47,092 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:47,092 INFO L89 Accepts]: Start accepts. Operand has 74 places, 199 transitions, 2585 flow [2022-12-13 13:09:47,093 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:47,093 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:47,093 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 199 transitions, 2585 flow [2022-12-13 13:09:47,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 199 transitions, 2585 flow [2022-12-13 13:09:47,315 INFO L130 PetriNetUnfolder]: 1268/2965 cut-off events. [2022-12-13 13:09:47,316 INFO L131 PetriNetUnfolder]: For 8834/9854 co-relation queries the response was YES. [2022-12-13 13:09:47,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12883 conditions, 2965 events. 1268/2965 cut-off events. For 8834/9854 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 24384 event pairs, 40 based on Foata normal form. 4/2887 useless extension candidates. Maximal degree in co-relation 12007. Up to 1637 conditions per place. [2022-12-13 13:09:47,339 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 199 transitions, 2585 flow [2022-12-13 13:09:47,340 INFO L226 LiptonReduction]: Number of co-enabled transitions 2594 [2022-12-13 13:09:47,346 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:09:47,347 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 255 [2022-12-13 13:09:47,347 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 199 transitions, 2585 flow [2022-12-13 13:09:47,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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-13 13:09:47,347 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:47,347 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:47,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 13:09:47,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 13:09:47,552 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:47,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:47,552 INFO L85 PathProgramCache]: Analyzing trace with hash 52337394, now seen corresponding path program 1 times [2022-12-13 13:09:47,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:47,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357389941] [2022-12-13 13:09:47,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:47,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:47,594 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-13 13:09:47,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:47,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357389941] [2022-12-13 13:09:47,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357389941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:47,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:47,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:09:47,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326406291] [2022-12-13 13:09:47,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:47,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:09:47,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:47,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:09:47,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:09:47,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-13 13:09:47,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 199 transitions, 2585 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 13:09:47,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:47,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-13 13:09:47,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:50,472 INFO L130 PetriNetUnfolder]: 27752/37928 cut-off events. [2022-12-13 13:09:50,473 INFO L131 PetriNetUnfolder]: For 229088/229193 co-relation queries the response was YES. [2022-12-13 13:09:50,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188635 conditions, 37928 events. 27752/37928 cut-off events. For 229088/229193 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 218408 event pairs, 8416 based on Foata normal form. 463/38391 useless extension candidates. Maximal degree in co-relation 106798. Up to 24822 conditions per place. [2022-12-13 13:09:50,772 INFO L137 encePairwiseOnDemand]: 30/41 looper letters, 302 selfloop transitions, 68 changer transitions 0/371 dead transitions. [2022-12-13 13:09:50,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 371 transitions, 5167 flow [2022-12-13 13:09:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:09:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:09:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-13 13:09:50,773 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5024390243902439 [2022-12-13 13:09:50,773 INFO L175 Difference]: Start difference. First operand has 74 places, 199 transitions, 2585 flow. Second operand 5 states and 103 transitions. [2022-12-13 13:09:50,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 371 transitions, 5167 flow [2022-12-13 13:09:51,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 371 transitions, 5113 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-13 13:09:51,277 INFO L231 Difference]: Finished difference. Result has 79 places, 210 transitions, 2925 flow [2022-12-13 13:09:51,277 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2531, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2925, PETRI_PLACES=79, PETRI_TRANSITIONS=210} [2022-12-13 13:09:51,277 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 41 predicate places. [2022-12-13 13:09:51,277 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:51,277 INFO L89 Accepts]: Start accepts. Operand has 79 places, 210 transitions, 2925 flow [2022-12-13 13:09:51,278 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:51,278 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:51,279 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 210 transitions, 2925 flow [2022-12-13 13:09:51,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 210 transitions, 2925 flow [2022-12-13 13:09:51,516 INFO L130 PetriNetUnfolder]: 1352/3268 cut-off events. [2022-12-13 13:09:51,516 INFO L131 PetriNetUnfolder]: For 12512/13962 co-relation queries the response was YES. [2022-12-13 13:09:51,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15051 conditions, 3268 events. 1352/3268 cut-off events. For 12512/13962 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 28358 event pairs, 47 based on Foata normal form. 8/3186 useless extension candidates. Maximal degree in co-relation 14069. Up to 1764 conditions per place. [2022-12-13 13:09:51,555 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 210 transitions, 2925 flow [2022-12-13 13:09:51,555 INFO L226 LiptonReduction]: Number of co-enabled transitions 2810 [2022-12-13 13:09:51,563 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:09:51,563 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 286 [2022-12-13 13:09:51,563 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 210 transitions, 2925 flow [2022-12-13 13:09:51,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 13:09:51,564 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:51,564 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:51,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 13:09:51,564 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:51,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1592249788, now seen corresponding path program 2 times [2022-12-13 13:09:51,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:51,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530911985] [2022-12-13 13:09:51,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:51,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:51,607 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-13 13:09:51,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:51,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530911985] [2022-12-13 13:09:51,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530911985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:51,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:51,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:09:51,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964563508] [2022-12-13 13:09:51,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:51,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:09:51,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:51,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:09:51,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:09:51,609 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-13 13:09:51,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 210 transitions, 2925 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 13:09:51,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:51,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-13 13:09:51,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:54,827 INFO L130 PetriNetUnfolder]: 26792/36532 cut-off events. [2022-12-13 13:09:54,827 INFO L131 PetriNetUnfolder]: For 233591/233696 co-relation queries the response was YES. [2022-12-13 13:09:54,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195734 conditions, 36532 events. 26792/36532 cut-off events. For 233591/233696 co-relation queries the response was YES. Maximal size of possible extension queue 1470. Compared 207947 event pairs, 6700 based on Foata normal form. 389/36921 useless extension candidates. Maximal degree in co-relation 150257. Up to 17695 conditions per place. [2022-12-13 13:09:55,049 INFO L137 encePairwiseOnDemand]: 33/41 looper letters, 288 selfloop transitions, 75 changer transitions 0/364 dead transitions. [2022-12-13 13:09:55,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 364 transitions, 5230 flow [2022-12-13 13:09:55,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:09:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:09:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-13 13:09:55,050 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4975609756097561 [2022-12-13 13:09:55,050 INFO L175 Difference]: Start difference. First operand has 79 places, 210 transitions, 2925 flow. Second operand 5 states and 102 transitions. [2022-12-13 13:09:55,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 364 transitions, 5230 flow [2022-12-13 13:09:55,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 364 transitions, 5086 flow, removed 44 selfloop flow, removed 1 redundant places. [2022-12-13 13:09:55,520 INFO L231 Difference]: Finished difference. Result has 83 places, 226 transitions, 3225 flow [2022-12-13 13:09:55,521 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2694, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3225, PETRI_PLACES=83, PETRI_TRANSITIONS=226} [2022-12-13 13:09:55,521 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 45 predicate places. [2022-12-13 13:09:55,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:55,521 INFO L89 Accepts]: Start accepts. Operand has 83 places, 226 transitions, 3225 flow [2022-12-13 13:09:55,522 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:55,522 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:55,522 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 226 transitions, 3225 flow [2022-12-13 13:09:55,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 226 transitions, 3225 flow [2022-12-13 13:09:55,785 INFO L130 PetriNetUnfolder]: 1393/3310 cut-off events. [2022-12-13 13:09:55,785 INFO L131 PetriNetUnfolder]: For 12738/14122 co-relation queries the response was YES. [2022-12-13 13:09:55,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15336 conditions, 3310 events. 1393/3310 cut-off events. For 12738/14122 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 28456 event pairs, 54 based on Foata normal form. 8/3229 useless extension candidates. Maximal degree in co-relation 14371. Up to 1812 conditions per place. [2022-12-13 13:09:55,825 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 226 transitions, 3225 flow [2022-12-13 13:09:55,826 INFO L226 LiptonReduction]: Number of co-enabled transitions 2888 [2022-12-13 13:09:55,833 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:09:55,835 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 314 [2022-12-13 13:09:55,835 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 226 transitions, 3225 flow [2022-12-13 13:09:55,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 13:09:55,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:55,836 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:55,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 13:09:55,836 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:55,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:55,836 INFO L85 PathProgramCache]: Analyzing trace with hash 251158658, now seen corresponding path program 2 times [2022-12-13 13:09:55,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:55,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994027473] [2022-12-13 13:09:55,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:55,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:55,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:55,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994027473] [2022-12-13 13:09:55,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994027473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:09:55,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849412836] [2022-12-13 13:09:55,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:09:55,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:09:55,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:09:55,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:09:55,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:09:55,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:09:55,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:09:55,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 13:09:55,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:09:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:55,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:09:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:56,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849412836] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:09:56,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:09:56,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-13 13:09:56,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720580441] [2022-12-13 13:09:56,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:09:56,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:09:56,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:56,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:09:56,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:09:56,008 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-13 13:09:56,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 226 transitions, 3225 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-13 13:09:56,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:56,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-13 13:09:56,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:59,443 INFO L130 PetriNetUnfolder]: 27192/37338 cut-off events. [2022-12-13 13:09:59,444 INFO L131 PetriNetUnfolder]: For 270053/270158 co-relation queries the response was YES. [2022-12-13 13:09:59,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200827 conditions, 37338 events. 27192/37338 cut-off events. For 270053/270158 co-relation queries the response was YES. Maximal size of possible extension queue 1487. Compared 215747 event pairs, 9202 based on Foata normal form. 533/37871 useless extension candidates. Maximal degree in co-relation 153068. Up to 23704 conditions per place. [2022-12-13 13:09:59,667 INFO L137 encePairwiseOnDemand]: 29/41 looper letters, 300 selfloop transitions, 87 changer transitions 0/388 dead transitions. [2022-12-13 13:09:59,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 388 transitions, 5574 flow [2022-12-13 13:09:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:09:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:09:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-12-13 13:09:59,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5040650406504065 [2022-12-13 13:09:59,670 INFO L175 Difference]: Start difference. First operand has 83 places, 226 transitions, 3225 flow. Second operand 6 states and 124 transitions. [2022-12-13 13:09:59,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 388 transitions, 5574 flow [2022-12-13 13:10:00,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 388 transitions, 5468 flow, removed 39 selfloop flow, removed 2 redundant places. [2022-12-13 13:10:00,098 INFO L231 Difference]: Finished difference. Result has 88 places, 242 transitions, 3583 flow [2022-12-13 13:10:00,099 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3119, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3583, PETRI_PLACES=88, PETRI_TRANSITIONS=242} [2022-12-13 13:10:00,099 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2022-12-13 13:10:00,099 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:10:00,099 INFO L89 Accepts]: Start accepts. Operand has 88 places, 242 transitions, 3583 flow [2022-12-13 13:10:00,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:10:00,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:10:00,100 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 242 transitions, 3583 flow [2022-12-13 13:10:00,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 242 transitions, 3583 flow [2022-12-13 13:10:00,382 INFO L130 PetriNetUnfolder]: 1368/3369 cut-off events. [2022-12-13 13:10:00,382 INFO L131 PetriNetUnfolder]: For 14838/16237 co-relation queries the response was YES. [2022-12-13 13:10:00,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15865 conditions, 3369 events. 1368/3369 cut-off events. For 14838/16237 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 29649 event pairs, 46 based on Foata normal form. 8/3282 useless extension candidates. Maximal degree in co-relation 14815. Up to 1826 conditions per place. [2022-12-13 13:10:00,417 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 242 transitions, 3583 flow [2022-12-13 13:10:00,417 INFO L226 LiptonReduction]: Number of co-enabled transitions 3056 [2022-12-13 13:10:00,424 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:10:00,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 326 [2022-12-13 13:10:00,425 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 242 transitions, 3583 flow [2022-12-13 13:10:00,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-13 13:10:00,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:00,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:00,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 13:10:00,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:10:00,630 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:10:00,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:00,630 INFO L85 PathProgramCache]: Analyzing trace with hash 181549704, now seen corresponding path program 3 times [2022-12-13 13:10:00,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:00,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133281537] [2022-12-13 13:10:00,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:00,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:00,672 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-13 13:10:00,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:00,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133281537] [2022-12-13 13:10:00,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133281537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:10:00,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:10:00,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:10:00,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62114324] [2022-12-13 13:10:00,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:10:00,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:10:00,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:00,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:10:00,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:10:00,674 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-13 13:10:00,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 242 transitions, 3583 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 13:10:00,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:00,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-13 13:10:00,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:05,043 INFO L130 PetriNetUnfolder]: 36428/50438 cut-off events. [2022-12-13 13:10:05,043 INFO L131 PetriNetUnfolder]: For 381006/381135 co-relation queries the response was YES. [2022-12-13 13:10:05,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269951 conditions, 50438 events. 36428/50438 cut-off events. For 381006/381135 co-relation queries the response was YES. Maximal size of possible extension queue 2120. Compared 315388 event pairs, 3986 based on Foata normal form. 827/51265 useless extension candidates. Maximal degree in co-relation 199995. Up to 23821 conditions per place. [2022-12-13 13:10:05,381 INFO L137 encePairwiseOnDemand]: 32/41 looper letters, 587 selfloop transitions, 64 changer transitions 0/652 dead transitions. [2022-12-13 13:10:05,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 652 transitions, 10084 flow [2022-12-13 13:10:05,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:10:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:10:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2022-12-13 13:10:05,382 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4738675958188153 [2022-12-13 13:10:05,382 INFO L175 Difference]: Start difference. First operand has 88 places, 242 transitions, 3583 flow. Second operand 7 states and 136 transitions. [2022-12-13 13:10:05,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 652 transitions, 10084 flow [2022-12-13 13:10:06,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 652 transitions, 9895 flow, removed 42 selfloop flow, removed 1 redundant places. [2022-12-13 13:10:06,181 INFO L231 Difference]: Finished difference. Result has 96 places, 280 transitions, 4310 flow [2022-12-13 13:10:06,181 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3479, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4310, PETRI_PLACES=96, PETRI_TRANSITIONS=280} [2022-12-13 13:10:06,181 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 58 predicate places. [2022-12-13 13:10:06,181 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:10:06,181 INFO L89 Accepts]: Start accepts. Operand has 96 places, 280 transitions, 4310 flow [2022-12-13 13:10:06,183 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:10:06,183 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:10:06,183 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 280 transitions, 4310 flow [2022-12-13 13:10:06,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 280 transitions, 4310 flow [2022-12-13 13:10:06,719 INFO L130 PetriNetUnfolder]: 2142/5101 cut-off events. [2022-12-13 13:10:06,719 INFO L131 PetriNetUnfolder]: For 30603/32130 co-relation queries the response was YES. [2022-12-13 13:10:06,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26071 conditions, 5101 events. 2142/5101 cut-off events. For 30603/32130 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 47591 event pairs, 63 based on Foata normal form. 23/4991 useless extension candidates. Maximal degree in co-relation 24606. Up to 2717 conditions per place. [2022-12-13 13:10:06,767 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 280 transitions, 4310 flow [2022-12-13 13:10:06,767 INFO L226 LiptonReduction]: Number of co-enabled transitions 4070 [2022-12-13 13:10:06,771 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] L62-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_1 v_~N~0_In_5)) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1, ~N~0=v_~N~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|, ~N~0=v_~N~0_In_5, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [460] $Ultimate##0-->L51-4: Formula: (and (= (+ v_~counter1~0_104 1) v_~counter1~0_105) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_41|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (= (ite (< 0 v_~counter1~0_105) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< 0 v_~N~0_83) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0))) InVars {~counter1~0=v_~counter1~0_105, ~N~0=v_~N~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_17|, ~counter1~0=v_~counter1~0_104, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_23|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_41|, ~N~0=v_~N~0_83} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, ~counter1~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:10:06,838 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] L62-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_1 v_~N~0_In_5)) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1, ~N~0=v_~N~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|, ~N~0=v_~N~0_In_5, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [460] $Ultimate##0-->L51-4: Formula: (and (= (+ v_~counter1~0_104 1) v_~counter1~0_105) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_41|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (= (ite (< 0 v_~counter1~0_105) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< 0 v_~N~0_83) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0))) InVars {~counter1~0=v_~counter1~0_105, ~N~0=v_~N~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_17|, ~counter1~0=v_~counter1~0_104, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_23|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_41|, ~N~0=v_~N~0_83} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, ~counter1~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:10:06,899 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] L62-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_1 v_~N~0_In_5)) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1, ~N~0=v_~N~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|, ~N~0=v_~N~0_In_5, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [460] $Ultimate##0-->L51-4: Formula: (and (= (+ v_~counter1~0_104 1) v_~counter1~0_105) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_41|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (= (ite (< 0 v_~counter1~0_105) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< 0 v_~N~0_83) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0))) InVars {~counter1~0=v_~counter1~0_105, ~N~0=v_~N~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_17|, ~counter1~0=v_~counter1~0_104, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_23|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_41|, ~N~0=v_~N~0_83} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, ~counter1~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:10:06,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] L62-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_1 v_~N~0_In_5)) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1, ~N~0=v_~N~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|, ~N~0=v_~N~0_In_5, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [460] $Ultimate##0-->L51-4: Formula: (and (= (+ v_~counter1~0_104 1) v_~counter1~0_105) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_41|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (= (ite (< 0 v_~counter1~0_105) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< 0 v_~N~0_83) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0))) InVars {~counter1~0=v_~counter1~0_105, ~N~0=v_~N~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_17|, ~counter1~0=v_~counter1~0_104, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_23|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_41|, ~N~0=v_~N~0_83} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, ~counter1~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 13:10:07,040 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:10:07,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 860 [2022-12-13 13:10:07,041 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 280 transitions, 4346 flow [2022-12-13 13:10:07,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 13:10:07,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:07,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:07,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 13:10:07,041 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:10:07,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash -834557496, now seen corresponding path program 2 times [2022-12-13 13:10:07,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:07,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213607115] [2022-12-13 13:10:07,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:07,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:07,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:07,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213607115] [2022-12-13 13:10:07,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213607115] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:10:07,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839025343] [2022-12-13 13:10:07,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:10:07,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:10:07,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:10:07,114 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:10:07,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 13:10:07,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:10:07,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:10:07,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 13:10:07,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:10:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:07,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:10:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:07,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839025343] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:10:07,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:10:07,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 13:10:07,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063622521] [2022-12-13 13:10:07,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:10:07,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:10:07,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:07,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:10:07,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:10:07,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-13 13:10:07,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 280 transitions, 4346 flow. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-13 13:10:07,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:07,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-13 13:10:07,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:12,758 INFO L130 PetriNetUnfolder]: 39838/55271 cut-off events. [2022-12-13 13:10:12,758 INFO L131 PetriNetUnfolder]: For 540232/540377 co-relation queries the response was YES. [2022-12-13 13:10:13,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323671 conditions, 55271 events. 39838/55271 cut-off events. For 540232/540377 co-relation queries the response was YES. Maximal size of possible extension queue 2342. Compared 345218 event pairs, 12766 based on Foata normal form. 621/55892 useless extension candidates. Maximal degree in co-relation 221810. Up to 33008 conditions per place. [2022-12-13 13:10:13,258 INFO L137 encePairwiseOnDemand]: 34/45 looper letters, 373 selfloop transitions, 189 changer transitions 0/563 dead transitions. [2022-12-13 13:10:13,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 563 transitions, 9323 flow [2022-12-13 13:10:13,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:10:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:10:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-12-13 13:10:13,260 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2022-12-13 13:10:13,260 INFO L175 Difference]: Start difference. First operand has 96 places, 280 transitions, 4346 flow. Second operand 7 states and 138 transitions. [2022-12-13 13:10:13,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 563 transitions, 9323 flow [2022-12-13 13:10:14,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 563 transitions, 9161 flow, removed 81 selfloop flow, removed 0 redundant places. [2022-12-13 13:10:14,777 INFO L231 Difference]: Finished difference. Result has 105 places, 387 transitions, 6777 flow [2022-12-13 13:10:14,778 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4246, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6777, PETRI_PLACES=105, PETRI_TRANSITIONS=387} [2022-12-13 13:10:14,778 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 67 predicate places. [2022-12-13 13:10:14,778 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:10:14,778 INFO L89 Accepts]: Start accepts. Operand has 105 places, 387 transitions, 6777 flow [2022-12-13 13:10:14,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:10:14,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:10:14,780 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 387 transitions, 6777 flow [2022-12-13 13:10:14,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 387 transitions, 6777 flow [2022-12-13 13:10:15,254 INFO L130 PetriNetUnfolder]: 2287/5497 cut-off events. [2022-12-13 13:10:15,254 INFO L131 PetriNetUnfolder]: For 36550/38853 co-relation queries the response was YES. [2022-12-13 13:10:15,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28608 conditions, 5497 events. 2287/5497 cut-off events. For 36550/38853 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 52253 event pairs, 65 based on Foata normal form. 36/5370 useless extension candidates. Maximal degree in co-relation 27006. Up to 2937 conditions per place. [2022-12-13 13:10:15,321 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 387 transitions, 6777 flow [2022-12-13 13:10:15,322 INFO L226 LiptonReduction]: Number of co-enabled transitions 5110 [2022-12-13 13:10:15,333 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:10:15,333 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 555 [2022-12-13 13:10:15,333 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 387 transitions, 6777 flow [2022-12-13 13:10:15,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-13 13:10:15,333 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:15,333 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:15,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 13:10:15,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:10:15,538 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:10:15,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:15,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1924993598, now seen corresponding path program 1 times [2022-12-13 13:10:15,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:15,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342087976] [2022-12-13 13:10:15,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:15,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:15,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:15,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342087976] [2022-12-13 13:10:15,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342087976] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:10:15,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597037865] [2022-12-13 13:10:15,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:15,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:10:15,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:10:15,581 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:10:15,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 13:10:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:15,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:10:15,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:10:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:15,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:10:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:15,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597037865] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:10:15,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:10:15,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 13:10:15,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115346954] [2022-12-13 13:10:15,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:10:15,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:10:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:15,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:10:15,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:10:15,721 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-13 13:10:15,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 387 transitions, 6777 flow. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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-13 13:10:15,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:15,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-13 13:10:15,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:23,971 INFO L130 PetriNetUnfolder]: 54630/76245 cut-off events. [2022-12-13 13:10:23,971 INFO L131 PetriNetUnfolder]: For 750034/750179 co-relation queries the response was YES. [2022-12-13 13:10:24,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444745 conditions, 76245 events. 54630/76245 cut-off events. For 750034/750179 co-relation queries the response was YES. Maximal size of possible extension queue 3183. Compared 502043 event pairs, 20700 based on Foata normal form. 1225/77470 useless extension candidates. Maximal degree in co-relation 357299. Up to 55471 conditions per place. [2022-12-13 13:10:24,636 INFO L137 encePairwiseOnDemand]: 35/45 looper letters, 598 selfloop transitions, 101 changer transitions 0/700 dead transitions. [2022-12-13 13:10:24,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 700 transitions, 11733 flow [2022-12-13 13:10:24,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:10:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:10:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2022-12-13 13:10:24,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47160493827160493 [2022-12-13 13:10:24,638 INFO L175 Difference]: Start difference. First operand has 105 places, 387 transitions, 6777 flow. Second operand 9 states and 191 transitions. [2022-12-13 13:10:24,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 700 transitions, 11733 flow [2022-12-13 13:10:27,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 700 transitions, 11295 flow, removed 62 selfloop flow, removed 3 redundant places. [2022-12-13 13:10:27,673 INFO L231 Difference]: Finished difference. Result has 115 places, 448 transitions, 7675 flow [2022-12-13 13:10:27,673 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6379, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7675, PETRI_PLACES=115, PETRI_TRANSITIONS=448} [2022-12-13 13:10:27,673 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 77 predicate places. [2022-12-13 13:10:27,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:10:27,673 INFO L89 Accepts]: Start accepts. Operand has 115 places, 448 transitions, 7675 flow [2022-12-13 13:10:27,675 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:10:27,675 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:10:27,676 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 448 transitions, 7675 flow [2022-12-13 13:10:27,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 448 transitions, 7675 flow [2022-12-13 13:10:28,400 INFO L130 PetriNetUnfolder]: 3314/8219 cut-off events. [2022-12-13 13:10:28,400 INFO L131 PetriNetUnfolder]: For 59429/61895 co-relation queries the response was YES. [2022-12-13 13:10:28,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43176 conditions, 8219 events. 3314/8219 cut-off events. For 59429/61895 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 85603 event pairs, 177 based on Foata normal form. 59/8050 useless extension candidates. Maximal degree in co-relation 40590. Up to 4202 conditions per place. [2022-12-13 13:10:28,506 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 448 transitions, 7675 flow [2022-12-13 13:10:28,506 INFO L226 LiptonReduction]: Number of co-enabled transitions 5920 [2022-12-13 13:10:28,511 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:10:28,512 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 839 [2022-12-13 13:10:28,512 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 448 transitions, 7675 flow [2022-12-13 13:10:28,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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-13 13:10:28,513 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:28,513 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:28,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 13:10:28,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 13:10:28,713 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:10:28,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1410704075, now seen corresponding path program 1 times [2022-12-13 13:10:28,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:28,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691734457] [2022-12-13 13:10:28,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:28,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:28,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:28,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:28,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691734457] [2022-12-13 13:10:28,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691734457] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:10:28,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202380191] [2022-12-13 13:10:28,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:28,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:10:28,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:10:28,761 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:10:28,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 13:10:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:28,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:10:28,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:10:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:28,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:10:28,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202380191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:10:28,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:10:28,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-12-13 13:10:28,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174306205] [2022-12-13 13:10:28,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:10:28,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:10:28,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:28,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:10:28,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:10:28,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-13 13:10:28,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 448 transitions, 7675 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 13:10:28,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:28,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-13 13:10:28,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:38,902 INFO L130 PetriNetUnfolder]: 57030/79627 cut-off events. [2022-12-13 13:10:38,902 INFO L131 PetriNetUnfolder]: For 864112/864257 co-relation queries the response was YES. [2022-12-13 13:10:39,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482274 conditions, 79627 events. 57030/79627 cut-off events. For 864112/864257 co-relation queries the response was YES. Maximal size of possible extension queue 3324. Compared 530320 event pairs, 24694 based on Foata normal form. 437/80064 useless extension candidates. Maximal degree in co-relation 440826. Up to 71011 conditions per place. [2022-12-13 13:10:39,641 INFO L137 encePairwiseOnDemand]: 38/45 looper letters, 520 selfloop transitions, 44 changer transitions 0/565 dead transitions. [2022-12-13 13:10:39,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 565 transitions, 10130 flow [2022-12-13 13:10:39,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:10:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:10:39,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-13 13:10:39,642 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-13 13:10:39,643 INFO L175 Difference]: Start difference. First operand has 115 places, 448 transitions, 7675 flow. Second operand 5 states and 111 transitions. [2022-12-13 13:10:39,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 565 transitions, 10130 flow [2022-12-13 13:10:43,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 565 transitions, 9908 flow, removed 99 selfloop flow, removed 1 redundant places. [2022-12-13 13:10:43,068 INFO L231 Difference]: Finished difference. Result has 119 places, 452 transitions, 7675 flow [2022-12-13 13:10:43,069 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=7467, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7675, PETRI_PLACES=119, PETRI_TRANSITIONS=452} [2022-12-13 13:10:43,069 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 81 predicate places. [2022-12-13 13:10:43,069 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:10:43,069 INFO L89 Accepts]: Start accepts. Operand has 119 places, 452 transitions, 7675 flow [2022-12-13 13:10:43,071 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:10:43,071 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:10:43,071 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 452 transitions, 7675 flow [2022-12-13 13:10:43,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 452 transitions, 7675 flow [2022-12-13 13:10:43,862 INFO L130 PetriNetUnfolder]: 3516/8621 cut-off events. [2022-12-13 13:10:43,862 INFO L131 PetriNetUnfolder]: For 66978/69702 co-relation queries the response was YES. [2022-12-13 13:10:43,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46028 conditions, 8621 events. 3516/8621 cut-off events. For 66978/69702 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 89682 event pairs, 183 based on Foata normal form. 55/8437 useless extension candidates. Maximal degree in co-relation 43479. Up to 4483 conditions per place. [2022-12-13 13:10:43,979 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 452 transitions, 7675 flow [2022-12-13 13:10:43,979 INFO L226 LiptonReduction]: Number of co-enabled transitions 5952 [2022-12-13 13:10:43,984 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:10:43,985 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 916 [2022-12-13 13:10:43,985 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 452 transitions, 7675 flow [2022-12-13 13:10:43,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 13:10:43,985 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:43,985 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:43,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 13:10:44,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:10:44,189 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:10:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash 701624539, now seen corresponding path program 1 times [2022-12-13 13:10:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:44,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426609222] [2022-12-13 13:10:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:44,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:44,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:44,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426609222] [2022-12-13 13:10:44,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426609222] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:10:44,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555152015] [2022-12-13 13:10:44,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:44,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:10:44,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:10:44,230 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:10:44,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 13:10:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:44,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:10:44,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:10:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:44,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:10:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:44,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555152015] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:10:44,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:10:44,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 13:10:44,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537872449] [2022-12-13 13:10:44,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:10:44,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:10:44,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:44,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:10:44,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:10:44,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-13 13:10:44,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 452 transitions, 7675 flow. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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-13 13:10:44,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:44,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-13 13:10:44,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:54,161 INFO L130 PetriNetUnfolder]: 55678/77677 cut-off events. [2022-12-13 13:10:54,161 INFO L131 PetriNetUnfolder]: For 855578/855723 co-relation queries the response was YES. [2022-12-13 13:10:54,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471390 conditions, 77677 events. 55678/77677 cut-off events. For 855578/855723 co-relation queries the response was YES. Maximal size of possible extension queue 3240. Compared 518226 event pairs, 7613 based on Foata normal form. 545/78222 useless extension candidates. Maximal degree in co-relation 441669. Up to 36961 conditions per place. [2022-12-13 13:10:54,875 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 750 selfloop transitions, 199 changer transitions 0/950 dead transitions. [2022-12-13 13:10:54,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 950 transitions, 15630 flow [2022-12-13 13:10:54,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:10:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 13:10:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 244 transitions. [2022-12-13 13:10:54,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3873015873015873 [2022-12-13 13:10:54,877 INFO L175 Difference]: Start difference. First operand has 119 places, 452 transitions, 7675 flow. Second operand 14 states and 244 transitions. [2022-12-13 13:10:54,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 950 transitions, 15630 flow