/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 20:44:29,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 20:44:29,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 20:44:29,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 20:44:29,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 20:44:29,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 20:44:29,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 20:44:29,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 20:44:29,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 20:44:29,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 20:44:29,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 20:44:29,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 20:44:29,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 20:44:29,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 20:44:29,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 20:44:29,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 20:44:29,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 20:44:29,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 20:44:29,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 20:44:29,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 20:44:29,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 20:44:29,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 20:44:29,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 20:44:29,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 20:44:29,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 20:44:29,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 20:44:29,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 20:44:29,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 20:44:29,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 20:44:29,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 20:44:29,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 20:44:29,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 20:44:29,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 20:44:29,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 20:44:29,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 20:44:29,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 20:44:29,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 20:44:29,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 20:44:29,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 20:44:29,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 20:44:29,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 20:44:29,428 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-VariableLbe.epf [2023-01-27 20:44:29,448 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 20:44:29,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 20:44:29,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 20:44:29,449 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 20:44:29,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 20:44:29,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 20:44:29,450 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 20:44:29,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 20:44:29,450 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 20:44:29,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 20:44:29,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 20:44:29,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 20:44:29,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 20:44:29,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 20:44:29,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 20:44:29,451 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 20:44:29,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 20:44:29,451 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 20:44:29,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 20:44:29,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 20:44:29,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 20:44:29,452 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 20:44:29,452 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 20:44:29,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 20:44:29,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 20:44:29,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 20:44:29,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 20:44:29,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 20:44:29,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 20:44:29,452 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 20:44:29,452 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 20:44:29,452 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-01-27 20:44:29,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 20:44:29,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 20:44:29,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 20:44:29,620 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 20:44:29,620 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 20:44:29,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2023-01-27 20:44:30,589 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 20:44:30,758 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 20:44:30,759 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2023-01-27 20:44:30,763 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a04f80c/0d4a61baa87c4ba7b85e1c15c18c5bad/FLAG6a26e0ff6 [2023-01-27 20:44:30,771 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a04f80c/0d4a61baa87c4ba7b85e1c15c18c5bad [2023-01-27 20:44:30,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 20:44:30,777 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 20:44:30,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 20:44:30,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 20:44:30,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 20:44:30,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 08:44:30" (1/1) ... [2023-01-27 20:44:30,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a38346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:44:30, skipping insertion in model container [2023-01-27 20:44:30,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 08:44:30" (1/1) ... [2023-01-27 20:44:30,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 20:44:30,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 20:44:30,897 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c[2116,2129] [2023-01-27 20:44:30,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 20:44:30,906 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 20:44:30,918 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c[2116,2129] [2023-01-27 20:44:30,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 20:44:30,928 INFO L208 MainTranslator]: Completed translation [2023-01-27 20:44:30,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:44:30 WrapperNode [2023-01-27 20:44:30,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 20:44:30,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 20:44:30,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 20:44:30,929 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 20:44:30,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:44:30" (1/1) ... [2023-01-27 20:44:30,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:44:30" (1/1) ... [2023-01-27 20:44:30,948 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2023-01-27 20:44:30,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 20:44:30,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 20:44:30,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 20:44:30,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 20:44:30,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:44:30" (1/1) ... [2023-01-27 20:44:30,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:44:30" (1/1) ... [2023-01-27 20:44:30,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:44:30" (1/1) ... [2023-01-27 20:44:30,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:44:30" (1/1) ... [2023-01-27 20:44:30,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:44:30" (1/1) ... [2023-01-27 20:44:30,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:44:30" (1/1) ... [2023-01-27 20:44:30,961 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:44:30" (1/1) ... [2023-01-27 20:44:30,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:44:30" (1/1) ... [2023-01-27 20:44:30,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 20:44:30,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 20:44:30,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 20:44:30,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 20:44:30,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:44:30" (1/1) ... [2023-01-27 20:44:30,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 20:44:30,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:44:30,986 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) [2023-01-27 20:44:30,988 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 [2023-01-27 20:44:31,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 20:44:31,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 20:44:31,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 20:44:31,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 20:44:31,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 20:44:31,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-27 20:44:31,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-27 20:44:31,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 20:44:31,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 20:44:31,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 20:44:31,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 20:44:31,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 20:44:31,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 20:44:31,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 20:44:31,016 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 20:44:31,106 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 20:44:31,107 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 20:44:31,318 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 20:44:31,323 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 20:44:31,323 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-27 20:44:31,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 08:44:31 BoogieIcfgContainer [2023-01-27 20:44:31,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 20:44:31,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 20:44:31,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 20:44:31,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 20:44:31,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 08:44:30" (1/3) ... [2023-01-27 20:44:31,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277904a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 08:44:31, skipping insertion in model container [2023-01-27 20:44:31,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:44:30" (2/3) ... [2023-01-27 20:44:31,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277904a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 08:44:31, skipping insertion in model container [2023-01-27 20:44:31,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 08:44:31" (3/3) ... [2023-01-27 20:44:31,330 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2023-01-27 20:44:31,341 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 20:44:31,341 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 20:44:31,341 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 20:44:31,436 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-27 20:44:31,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 105 transitions, 234 flow [2023-01-27 20:44:31,505 INFO L130 PetriNetUnfolder]: 7/102 cut-off events. [2023-01-27 20:44:31,505 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 20:44:31,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 7/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-01-27 20:44:31,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 105 transitions, 234 flow [2023-01-27 20:44:31,512 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 92 transitions, 202 flow [2023-01-27 20:44:31,514 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 20:44:31,519 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 92 transitions, 202 flow [2023-01-27 20:44:31,521 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 92 transitions, 202 flow [2023-01-27 20:44:31,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 92 transitions, 202 flow [2023-01-27 20:44:31,541 INFO L130 PetriNetUnfolder]: 7/92 cut-off events. [2023-01-27 20:44:31,541 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 20:44:31,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 92 events. 7/92 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-01-27 20:44:31,543 INFO L119 LiptonReduction]: Number of co-enabled transitions 1320 [2023-01-27 20:44:33,536 INFO L134 LiptonReduction]: Checked pairs total: 1314 [2023-01-27 20:44:33,536 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-01-27 20:44:33,545 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 20:44:33,549 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=PETRI_NET, 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;@2effc428, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 20:44:33,549 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-27 20:44:33,553 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2023-01-27 20:44:33,553 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 20:44:33,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:44:33,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:44:33,554 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 1 more)] === [2023-01-27 20:44:33,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:44:33,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1681500982, now seen corresponding path program 1 times [2023-01-27 20:44:33,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:44:33,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651541016] [2023-01-27 20:44:33,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:44:33,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:44:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:44:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:44:33,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:44:33,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651541016] [2023-01-27 20:44:33,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651541016] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:44:33,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:44:33,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 20:44:33,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794327000] [2023-01-27 20:44:33,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:44:33,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 20:44:33,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:44:33,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 20:44:33,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 20:44:33,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 183 [2023-01-27 20:44:33,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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) [2023-01-27 20:44:33,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:44:33,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 183 [2023-01-27 20:44:33,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:44:34,054 INFO L130 PetriNetUnfolder]: 359/506 cut-off events. [2023-01-27 20:44:34,054 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2023-01-27 20:44:34,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 506 events. 359/506 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1611 event pairs, 39 based on Foata normal form. 1/308 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2023-01-27 20:44:34,058 INFO L137 encePairwiseOnDemand]: 178/183 looper letters, 30 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2023-01-27 20:44:34,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 179 flow [2023-01-27 20:44:34,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 20:44:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 20:44:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-01-27 20:44:34,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5409836065573771 [2023-01-27 20:44:34,068 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-01-27 20:44:34,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-01-27 20:44:34,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:44:34,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-01-27 20:44:34,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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) [2023-01-27 20:44:34,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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) [2023-01-27 20:44:34,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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) [2023-01-27 20:44:34,077 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 62 flow. Second operand 3 states and 297 transitions. [2023-01-27 20:44:34,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 179 flow [2023-01-27 20:44:34,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 38 transitions, 157 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-01-27 20:44:34,081 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 76 flow [2023-01-27 20:44:34,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2023-01-27 20:44:34,084 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places. [2023-01-27 20:44:34,084 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 76 flow [2023-01-27 20:44:34,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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) [2023-01-27 20:44:34,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:44:34,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:44:34,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 20:44:34,085 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 1 more)] === [2023-01-27 20:44:34,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:44:34,085 INFO L85 PathProgramCache]: Analyzing trace with hash -296399337, now seen corresponding path program 1 times [2023-01-27 20:44:34,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:44:34,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138812108] [2023-01-27 20:44:34,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:44:34,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:44:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:44:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:44:34,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:44:34,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138812108] [2023-01-27 20:44:34,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138812108] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:44:34,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:44:34,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 20:44:34,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959635182] [2023-01-27 20:44:34,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:44:34,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 20:44:34,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:44:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 20:44:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 20:44:34,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:44:34,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 76 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:44:34,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:44:34,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:44:34,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:44:34,595 INFO L130 PetriNetUnfolder]: 596/906 cut-off events. [2023-01-27 20:44:34,595 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2023-01-27 20:44:34,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 906 events. 596/906 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3355 event pairs, 166 based on Foata normal form. 6/912 useless extension candidates. Maximal degree in co-relation 616. Up to 420 conditions per place. [2023-01-27 20:44:34,599 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 69 selfloop transitions, 8 changer transitions 8/85 dead transitions. [2023-01-27 20:44:34,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 85 transitions, 416 flow [2023-01-27 20:44:34,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 20:44:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 20:44:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 603 transitions. [2023-01-27 20:44:34,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707259953161593 [2023-01-27 20:44:34,601 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 603 transitions. [2023-01-27 20:44:34,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 603 transitions. [2023-01-27 20:44:34,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:44:34,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 603 transitions. [2023-01-27 20:44:34,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 86.14285714285714) internal successors, (603), 7 states have internal predecessors, (603), 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) [2023-01-27 20:44:34,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:44:34,605 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:44:34,605 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 76 flow. Second operand 7 states and 603 transitions. [2023-01-27 20:44:34,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 85 transitions, 416 flow [2023-01-27 20:44:34,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 85 transitions, 406 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 20:44:34,607 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 139 flow [2023-01-27 20:44:34,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=139, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2023-01-27 20:44:34,608 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2023-01-27 20:44:34,608 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 139 flow [2023-01-27 20:44:34,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:44:34,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:44:34,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:44:34,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 20:44:34,609 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 20:44:34,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:44:34,609 INFO L85 PathProgramCache]: Analyzing trace with hash -748397025, now seen corresponding path program 2 times [2023-01-27 20:44:34,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:44:34,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958902219] [2023-01-27 20:44:34,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:44:34,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:44:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:44:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:44:34,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:44:34,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958902219] [2023-01-27 20:44:34,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958902219] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:44:34,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683390046] [2023-01-27 20:44:34,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 20:44:34,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:44:34,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:44:34,809 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) [2023-01-27 20:44:34,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-27 20:44:34,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 20:44:34,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:44:34,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-27 20:44:34,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:44:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:44:35,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:44:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:44:35,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683390046] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 20:44:35,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 20:44:35,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 14 [2023-01-27 20:44:35,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837071384] [2023-01-27 20:44:35,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:44:35,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 20:44:35,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:44:35,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 20:44:35,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-01-27 20:44:35,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 183 [2023-01-27 20:44:35,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2023-01-27 20:44:35,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:44:35,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 183 [2023-01-27 20:44:35,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:44:35,458 INFO L130 PetriNetUnfolder]: 832/1268 cut-off events. [2023-01-27 20:44:35,458 INFO L131 PetriNetUnfolder]: For 1476/1531 co-relation queries the response was YES. [2023-01-27 20:44:35,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4023 conditions, 1268 events. 832/1268 cut-off events. For 1476/1531 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5353 event pairs, 172 based on Foata normal form. 6/1272 useless extension candidates. Maximal degree in co-relation 1710. Up to 409 conditions per place. [2023-01-27 20:44:35,464 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 99 selfloop transitions, 17 changer transitions 1/118 dead transitions. [2023-01-27 20:44:35,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 118 transitions, 705 flow [2023-01-27 20:44:35,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 20:44:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 20:44:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 729 transitions. [2023-01-27 20:44:35,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979508196721312 [2023-01-27 20:44:35,466 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 729 transitions. [2023-01-27 20:44:35,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 729 transitions. [2023-01-27 20:44:35,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:44:35,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 729 transitions. [2023-01-27 20:44:35,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 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) [2023-01-27 20:44:35,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 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) [2023-01-27 20:44:35,470 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 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) [2023-01-27 20:44:35,470 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 139 flow. Second operand 8 states and 729 transitions. [2023-01-27 20:44:35,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 118 transitions, 705 flow [2023-01-27 20:44:35,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 118 transitions, 675 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-01-27 20:44:35,474 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 294 flow [2023-01-27 20:44:35,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=294, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2023-01-27 20:44:35,475 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2023-01-27 20:44:35,475 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 294 flow [2023-01-27 20:44:35,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2023-01-27 20:44:35,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:44:35,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:44:35,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-27 20:44:35,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:44:35,681 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 1 more)] === [2023-01-27 20:44:35,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:44:35,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1550280123, now seen corresponding path program 3 times [2023-01-27 20:44:35,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:44:35,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652292801] [2023-01-27 20:44:35,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:44:35,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:44:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:44:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:44:35,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:44:35,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652292801] [2023-01-27 20:44:35,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652292801] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:44:35,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:44:35,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 20:44:35,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647931199] [2023-01-27 20:44:35,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:44:35,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 20:44:35,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:44:35,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 20:44:35,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-01-27 20:44:35,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:44:35,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 294 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:44:35,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:44:35,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:44:35,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:44:36,180 INFO L130 PetriNetUnfolder]: 1203/1834 cut-off events. [2023-01-27 20:44:36,183 INFO L131 PetriNetUnfolder]: For 5174/5174 co-relation queries the response was YES. [2023-01-27 20:44:36,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7019 conditions, 1834 events. 1203/1834 cut-off events. For 5174/5174 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8187 event pairs, 336 based on Foata normal form. 12/1846 useless extension candidates. Maximal degree in co-relation 5374. Up to 928 conditions per place. [2023-01-27 20:44:36,192 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 108 selfloop transitions, 29 changer transitions 18/155 dead transitions. [2023-01-27 20:44:36,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 155 transitions, 1178 flow [2023-01-27 20:44:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 20:44:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 20:44:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 860 transitions. [2023-01-27 20:44:36,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46994535519125685 [2023-01-27 20:44:36,194 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 860 transitions. [2023-01-27 20:44:36,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 860 transitions. [2023-01-27 20:44:36,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:44:36,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 860 transitions. [2023-01-27 20:44:36,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 86.0) internal successors, (860), 10 states have internal predecessors, (860), 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) [2023-01-27 20:44:36,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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) [2023-01-27 20:44:36,199 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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) [2023-01-27 20:44:36,199 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 294 flow. Second operand 10 states and 860 transitions. [2023-01-27 20:44:36,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 155 transitions, 1178 flow [2023-01-27 20:44:36,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 155 transitions, 1174 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-01-27 20:44:36,211 INFO L231 Difference]: Finished difference. Result has 62 places, 73 transitions, 620 flow [2023-01-27 20:44:36,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=620, PETRI_PLACES=62, PETRI_TRANSITIONS=73} [2023-01-27 20:44:36,212 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 33 predicate places. [2023-01-27 20:44:36,212 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 73 transitions, 620 flow [2023-01-27 20:44:36,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:44:36,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:44:36,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:44:36,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 20:44:36,213 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 1 more)] === [2023-01-27 20:44:36,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:44:36,213 INFO L85 PathProgramCache]: Analyzing trace with hash 382118611, now seen corresponding path program 4 times [2023-01-27 20:44:36,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:44:36,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970673222] [2023-01-27 20:44:36,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:44:36,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:44:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:44:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:44:36,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:44:36,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970673222] [2023-01-27 20:44:36,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970673222] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:44:36,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927642832] [2023-01-27 20:44:36,329 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 20:44:36,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:44:36,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:44:36,336 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) [2023-01-27 20:44:36,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-27 20:44:36,423 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 20:44:36,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:44:36,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-27 20:44:36,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:44:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:44:36,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:44:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:44:40,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927642832] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:44:40,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:44:40,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2023-01-27 20:44:40,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692468814] [2023-01-27 20:44:40,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:44:40,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-01-27 20:44:40,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:44:40,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-01-27 20:44:40,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=171, Unknown=1, NotChecked=0, Total=240 [2023-01-27 20:44:40,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:44:40,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 73 transitions, 620 flow. Second operand has 16 states, 16 states have (on average 77.125) internal successors, (1234), 16 states have internal predecessors, (1234), 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) [2023-01-27 20:44:40,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:44:40,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:44:40,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:44:43,145 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_thread3Thread1of1ForFork0_~i~2 4294967296)) (.cse3 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296))) (and (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse0 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 0) (< 1 .cse0) (let ((.cse1 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ (* (div (+ .cse1 .cse2) 4294967296) 4294967296) .cse3) .cse1)) (< .cse0 0) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse4 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse4) (let ((.cse5 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ (* (div (+ .cse5 .cse2) 4294967296) 4294967296) .cse3) .cse5)) (< .cse4 0) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))))) is different from false [2023-01-27 20:45:02,606 WARN L222 SmtUtils]: Spent 19.21s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:45:17,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:19,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:21,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:23,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:25,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:27,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:29,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:31,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:33,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:35,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:37,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:41,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:43,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:45,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:47,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:49,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:51,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:53,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:55,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:57,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:45:59,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:01,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:04,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:06,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:08,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:10,211 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_thread3Thread1of1ForFork0_~i~2 4294967296)) (.cse3 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296))) (and (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse0 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 0) (< 1 .cse0) (let ((.cse1 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ (* (div (+ .cse1 .cse2) 4294967296) 4294967296) .cse3) .cse1)) (< .cse0 0) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (let ((.cse4 (* 4294967295 c_~a~0))) (< (+ (* (div (+ .cse4 .cse2) 4294967296) 4294967296) .cse3) .cse4)) (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse5 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse5) (let ((.cse6 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ (* (div (+ .cse6 .cse2) 4294967296) 4294967296) .cse3) .cse6)) (< .cse5 0) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))))) is different from false [2023-01-27 20:46:18,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:20,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:22,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:24,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:26,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:28,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:30,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:32,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:34,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:36,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:38,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:40,693 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_thread3Thread1of1ForFork0_~i~2 4294967296)) (.cse2 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296))) (and (< .cse0 (mod (+ c_~b~0 c_~a~0) 4294967296)) (= c_thread2Thread1of1ForFork2_~i~1 0) (let ((.cse1 (* 4294967295 c_~a~0))) (< (+ (* (div (+ .cse1 .cse0) 4294967296) 4294967296) .cse2) .cse1)) (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse3 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse3) (let ((.cse4 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ (* (div (+ .cse4 .cse0) 4294967296) 4294967296) .cse2) .cse4)) (< .cse3 0) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))))) is different from false [2023-01-27 20:46:42,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:44,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:46,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:48,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:50,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:52,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:55,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:46:57,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:01,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:03,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:05,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:07,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:09,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:11,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:13,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:15,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:17,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:20,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:22,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:24,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:24,112 INFO L130 PetriNetUnfolder]: 2574/3994 cut-off events. [2023-01-27 20:47:24,113 INFO L131 PetriNetUnfolder]: For 18262/18262 co-relation queries the response was YES. [2023-01-27 20:47:24,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17820 conditions, 3994 events. 2574/3994 cut-off events. For 18262/18262 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 21028 event pairs, 319 based on Foata normal form. 54/4048 useless extension candidates. Maximal degree in co-relation 15889. Up to 1394 conditions per place. [2023-01-27 20:47:24,139 INFO L137 encePairwiseOnDemand]: 170/183 looper letters, 224 selfloop transitions, 132 changer transitions 3/359 dead transitions. [2023-01-27 20:47:24,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 359 transitions, 2963 flow [2023-01-27 20:47:24,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-27 20:47:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-01-27 20:47:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2306 transitions. [2023-01-27 20:47:24,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4667071443027727 [2023-01-27 20:47:24,149 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2306 transitions. [2023-01-27 20:47:24,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2306 transitions. [2023-01-27 20:47:24,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:47:24,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2306 transitions. [2023-01-27 20:47:24,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 85.4074074074074) internal successors, (2306), 27 states have internal predecessors, (2306), 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) [2023-01-27 20:47:24,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 183.0) internal successors, (5124), 28 states have internal predecessors, (5124), 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) [2023-01-27 20:47:24,160 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 183.0) internal successors, (5124), 28 states have internal predecessors, (5124), 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) [2023-01-27 20:47:24,160 INFO L175 Difference]: Start difference. First operand has 62 places, 73 transitions, 620 flow. Second operand 27 states and 2306 transitions. [2023-01-27 20:47:24,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 359 transitions, 2963 flow [2023-01-27 20:47:24,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 359 transitions, 2905 flow, removed 29 selfloop flow, removed 1 redundant places. [2023-01-27 20:47:24,193 INFO L231 Difference]: Finished difference. Result has 110 places, 180 transitions, 2050 flow [2023-01-27 20:47:24,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2050, PETRI_PLACES=110, PETRI_TRANSITIONS=180} [2023-01-27 20:47:24,195 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 81 predicate places. [2023-01-27 20:47:24,195 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 180 transitions, 2050 flow [2023-01-27 20:47:24,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 77.125) internal successors, (1234), 16 states have internal predecessors, (1234), 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) [2023-01-27 20:47:24,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:47:24,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:47:24,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-27 20:47:24,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:47:24,397 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 1 more)] === [2023-01-27 20:47:24,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:47:24,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2033487921, now seen corresponding path program 1 times [2023-01-27 20:47:24,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:47:24,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626164703] [2023-01-27 20:47:24,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:47:24,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:47:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:47:24,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:47:24,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:47:24,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626164703] [2023-01-27 20:47:24,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626164703] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:47:24,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048473662] [2023-01-27 20:47:24,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:47:24,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:47:24,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:47:24,557 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) [2023-01-27 20:47:24,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-27 20:47:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:47:24,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-27 20:47:24,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:47:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:47:24,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:47:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:47:24,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048473662] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:47:24,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:47:24,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2023-01-27 20:47:24,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397021685] [2023-01-27 20:47:24,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:47:24,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 20:47:24,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:47:24,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 20:47:24,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-01-27 20:47:24,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:47:24,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 180 transitions, 2050 flow. Second operand has 10 states, 10 states have (on average 77.8) internal successors, (778), 10 states have internal predecessors, (778), 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) [2023-01-27 20:47:24,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:47:24,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:47:24,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:47:25,463 INFO L130 PetriNetUnfolder]: 2832/4451 cut-off events. [2023-01-27 20:47:25,463 INFO L131 PetriNetUnfolder]: For 79484/79484 co-relation queries the response was YES. [2023-01-27 20:47:25,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32518 conditions, 4451 events. 2832/4451 cut-off events. For 79484/79484 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 24604 event pairs, 562 based on Foata normal form. 38/4489 useless extension candidates. Maximal degree in co-relation 26368. Up to 1638 conditions per place. [2023-01-27 20:47:25,507 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 241 selfloop transitions, 78 changer transitions 4/323 dead transitions. [2023-01-27 20:47:25,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 323 transitions, 4255 flow [2023-01-27 20:47:25,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 20:47:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 20:47:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 873 transitions. [2023-01-27 20:47:25,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47704918032786886 [2023-01-27 20:47:25,511 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 873 transitions. [2023-01-27 20:47:25,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 873 transitions. [2023-01-27 20:47:25,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:47:25,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 873 transitions. [2023-01-27 20:47:25,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 87.3) internal successors, (873), 10 states have internal predecessors, (873), 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) [2023-01-27 20:47:25,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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) [2023-01-27 20:47:25,517 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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) [2023-01-27 20:47:25,517 INFO L175 Difference]: Start difference. First operand has 110 places, 180 transitions, 2050 flow. Second operand 10 states and 873 transitions. [2023-01-27 20:47:25,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 323 transitions, 4255 flow [2023-01-27 20:47:25,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 323 transitions, 3917 flow, removed 169 selfloop flow, removed 0 redundant places. [2023-01-27 20:47:25,675 INFO L231 Difference]: Finished difference. Result has 124 places, 211 transitions, 2487 flow [2023-01-27 20:47:25,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1784, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2487, PETRI_PLACES=124, PETRI_TRANSITIONS=211} [2023-01-27 20:47:25,676 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 95 predicate places. [2023-01-27 20:47:25,676 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 211 transitions, 2487 flow [2023-01-27 20:47:25,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.8) internal successors, (778), 10 states have internal predecessors, (778), 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) [2023-01-27 20:47:25,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:47:25,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:47:25,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-27 20:47:25,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:47:25,881 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 1 more)] === [2023-01-27 20:47:25,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:47:25,882 INFO L85 PathProgramCache]: Analyzing trace with hash -948140923, now seen corresponding path program 2 times [2023-01-27 20:47:25,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:47:25,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056586057] [2023-01-27 20:47:25,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:47:25,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:47:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:47:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:47:26,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:47:26,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056586057] [2023-01-27 20:47:26,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056586057] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:47:26,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444807270] [2023-01-27 20:47:26,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 20:47:26,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:47:26,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:47:26,015 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) [2023-01-27 20:47:26,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-27 20:47:26,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 20:47:26,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:47:26,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-27 20:47:26,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:47:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:47:26,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:47:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:47:26,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444807270] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:47:26,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:47:26,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 10 [2023-01-27 20:47:26,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955345562] [2023-01-27 20:47:26,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:47:26,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 20:47:26,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:47:26,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 20:47:26,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-01-27 20:47:26,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:47:26,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 211 transitions, 2487 flow. Second operand has 10 states, 10 states have (on average 77.7) internal successors, (777), 10 states have internal predecessors, (777), 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) [2023-01-27 20:47:26,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:47:26,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:47:26,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:47:31,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:34,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:37,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:40,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:42,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:44,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:45,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:47,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:50,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:52,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:54,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:56,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:47:58,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:00,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:02,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:06,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:08,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:10,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:12,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:14,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:16,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:18,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:20,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:22,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:23,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:25,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:27,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:32,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:34,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:37,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:39,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:42,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:44,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:46,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:48,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:50,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:54,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:57,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:48:58,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:00,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:04,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:06,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:08,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:10,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:12,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:17,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:19,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:21,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:26,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:29,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:33,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:35,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:38,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:40,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:41,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:43,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:45,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:48,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:52,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:53,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:49:59,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:50:02,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:50:03,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:50:05,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:50:07,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:50:08,146 INFO L130 PetriNetUnfolder]: 3712/5859 cut-off events. [2023-01-27 20:50:08,147 INFO L131 PetriNetUnfolder]: For 124565/124565 co-relation queries the response was YES. [2023-01-27 20:50:08,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45414 conditions, 5859 events. 3712/5859 cut-off events. For 124565/124565 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 34046 event pairs, 598 based on Foata normal form. 24/5857 useless extension candidates. Maximal degree in co-relation 37318. Up to 2230 conditions per place. [2023-01-27 20:50:08,187 INFO L137 encePairwiseOnDemand]: 173/183 looper letters, 267 selfloop transitions, 169 changer transitions 2/438 dead transitions. [2023-01-27 20:50:08,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 438 transitions, 6064 flow [2023-01-27 20:50:08,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-27 20:50:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-01-27 20:50:08,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1306 transitions. [2023-01-27 20:50:08,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4757741347905282 [2023-01-27 20:50:08,193 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1306 transitions. [2023-01-27 20:50:08,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1306 transitions. [2023-01-27 20:50:08,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:08,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1306 transitions. [2023-01-27 20:50:08,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 87.06666666666666) internal successors, (1306), 15 states have internal predecessors, (1306), 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) [2023-01-27 20:50:08,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 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) [2023-01-27 20:50:08,259 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 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) [2023-01-27 20:50:08,259 INFO L175 Difference]: Start difference. First operand has 124 places, 211 transitions, 2487 flow. Second operand 15 states and 1306 transitions. [2023-01-27 20:50:08,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 438 transitions, 6064 flow [2023-01-27 20:50:08,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 438 transitions, 5937 flow, removed 42 selfloop flow, removed 1 redundant places. [2023-01-27 20:50:08,534 INFO L231 Difference]: Finished difference. Result has 148 places, 296 transitions, 4256 flow [2023-01-27 20:50:08,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2412, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4256, PETRI_PLACES=148, PETRI_TRANSITIONS=296} [2023-01-27 20:50:08,534 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 119 predicate places. [2023-01-27 20:50:08,534 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 296 transitions, 4256 flow [2023-01-27 20:50:08,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.7) internal successors, (777), 10 states have internal predecessors, (777), 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) [2023-01-27 20:50:08,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:08,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:08,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-27 20:50:08,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:50:08,740 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 1 more)] === [2023-01-27 20:50:08,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash -245491509, now seen corresponding path program 5 times [2023-01-27 20:50:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:08,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519996876] [2023-01-27 20:50:08,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:08,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:08,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:08,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519996876] [2023-01-27 20:50:08,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519996876] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:50:08,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657284832] [2023-01-27 20:50:08,866 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 20:50:08,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:50:08,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:50:08,867 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) [2023-01-27 20:50:08,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-27 20:50:08,941 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 20:50:08,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:50:08,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2023-01-27 20:50:08,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:50:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:09,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:50:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:09,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657284832] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:50:09,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:50:09,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-01-27 20:50:09,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102114426] [2023-01-27 20:50:09,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:50:09,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-27 20:50:09,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:09,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-27 20:50:09,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-01-27 20:50:09,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:50:09,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 296 transitions, 4256 flow. Second operand has 12 states, 12 states have (on average 77.91666666666667) internal successors, (935), 12 states have internal predecessors, (935), 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) [2023-01-27 20:50:09,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:09,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:50:09,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:10,252 INFO L130 PetriNetUnfolder]: 3950/6347 cut-off events. [2023-01-27 20:50:10,252 INFO L131 PetriNetUnfolder]: For 158540/158540 co-relation queries the response was YES. [2023-01-27 20:50:10,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53468 conditions, 6347 events. 3950/6347 cut-off events. For 158540/158540 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 38539 event pairs, 746 based on Foata normal form. 32/6367 useless extension candidates. Maximal degree in co-relation 45183. Up to 2402 conditions per place. [2023-01-27 20:50:10,294 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 273 selfloop transitions, 194 changer transitions 3/470 dead transitions. [2023-01-27 20:50:10,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 470 transitions, 7482 flow [2023-01-27 20:50:10,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 20:50:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 20:50:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 873 transitions. [2023-01-27 20:50:10,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47704918032786886 [2023-01-27 20:50:10,296 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 873 transitions. [2023-01-27 20:50:10,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 873 transitions. [2023-01-27 20:50:10,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:10,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 873 transitions. [2023-01-27 20:50:10,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 87.3) internal successors, (873), 10 states have internal predecessors, (873), 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) [2023-01-27 20:50:10,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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) [2023-01-27 20:50:10,300 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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) [2023-01-27 20:50:10,300 INFO L175 Difference]: Start difference. First operand has 148 places, 296 transitions, 4256 flow. Second operand 10 states and 873 transitions. [2023-01-27 20:50:10,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 470 transitions, 7482 flow [2023-01-27 20:50:10,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 470 transitions, 7258 flow, removed 103 selfloop flow, removed 1 redundant places. [2023-01-27 20:50:10,714 INFO L231 Difference]: Finished difference. Result has 162 places, 350 transitions, 5670 flow [2023-01-27 20:50:10,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=4093, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5670, PETRI_PLACES=162, PETRI_TRANSITIONS=350} [2023-01-27 20:50:10,715 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 133 predicate places. [2023-01-27 20:50:10,715 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 350 transitions, 5670 flow [2023-01-27 20:50:10,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 77.91666666666667) internal successors, (935), 12 states have internal predecessors, (935), 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) [2023-01-27 20:50:10,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:10,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:10,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-27 20:50:10,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:50:10,919 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 1 more)] === [2023-01-27 20:50:10,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:10,919 INFO L85 PathProgramCache]: Analyzing trace with hash -648798255, now seen corresponding path program 6 times [2023-01-27 20:50:10,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:10,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290516801] [2023-01-27 20:50:10,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:10,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:11,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:11,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290516801] [2023-01-27 20:50:11,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290516801] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:50:11,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334137240] [2023-01-27 20:50:11,018 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 20:50:11,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:50:11,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:50:11,019 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) [2023-01-27 20:50:11,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-27 20:50:11,083 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-27 20:50:11,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:50:11,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-27 20:50:11,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:50:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:11,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:50:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:11,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334137240] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 20:50:11,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 20:50:11,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 14 [2023-01-27 20:50:11,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213954720] [2023-01-27 20:50:11,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:50:11,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 20:50:11,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:11,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 20:50:11,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-01-27 20:50:11,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 183 [2023-01-27 20:50:11,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 350 transitions, 5670 flow. Second operand has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2023-01-27 20:50:11,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:11,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 183 [2023-01-27 20:50:11,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:12,391 INFO L130 PetriNetUnfolder]: 4338/7019 cut-off events. [2023-01-27 20:50:12,392 INFO L131 PetriNetUnfolder]: For 182224/182368 co-relation queries the response was YES. [2023-01-27 20:50:12,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60580 conditions, 7019 events. 4338/7019 cut-off events. For 182224/182368 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 44161 event pairs, 918 based on Foata normal form. 39/7018 useless extension candidates. Maximal degree in co-relation 59151. Up to 2563 conditions per place. [2023-01-27 20:50:12,449 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 304 selfloop transitions, 164 changer transitions 1/478 dead transitions. [2023-01-27 20:50:12,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 478 transitions, 8263 flow [2023-01-27 20:50:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 20:50:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 20:50:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 729 transitions. [2023-01-27 20:50:12,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979508196721312 [2023-01-27 20:50:12,451 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 729 transitions. [2023-01-27 20:50:12,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 729 transitions. [2023-01-27 20:50:12,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:12,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 729 transitions. [2023-01-27 20:50:12,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 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) [2023-01-27 20:50:12,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 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) [2023-01-27 20:50:12,454 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 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) [2023-01-27 20:50:12,454 INFO L175 Difference]: Start difference. First operand has 162 places, 350 transitions, 5670 flow. Second operand 8 states and 729 transitions. [2023-01-27 20:50:12,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 478 transitions, 8263 flow [2023-01-27 20:50:12,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 478 transitions, 7969 flow, removed 48 selfloop flow, removed 4 redundant places. [2023-01-27 20:50:12,924 INFO L231 Difference]: Finished difference. Result has 169 places, 381 transitions, 6500 flow [2023-01-27 20:50:12,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=5454, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6500, PETRI_PLACES=169, PETRI_TRANSITIONS=381} [2023-01-27 20:50:12,924 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 140 predicate places. [2023-01-27 20:50:12,924 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 381 transitions, 6500 flow [2023-01-27 20:50:12,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2023-01-27 20:50:12,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:12,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:12,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-27 20:50:13,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:50:13,125 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 1 more)] === [2023-01-27 20:50:13,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:13,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2095434481, now seen corresponding path program 3 times [2023-01-27 20:50:13,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:13,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473558611] [2023-01-27 20:50:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:13,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:13,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:13,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473558611] [2023-01-27 20:50:13,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473558611] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:50:13,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:50:13,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 20:50:13,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765321020] [2023-01-27 20:50:13,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:50:13,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 20:50:13,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:13,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 20:50:13,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 20:50:13,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:50:13,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 381 transitions, 6500 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:50:13,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:13,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:50:13,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:14,528 INFO L130 PetriNetUnfolder]: 4432/7139 cut-off events. [2023-01-27 20:50:14,528 INFO L131 PetriNetUnfolder]: For 180839/180839 co-relation queries the response was YES. [2023-01-27 20:50:14,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62223 conditions, 7139 events. 4432/7139 cut-off events. For 180839/180839 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 44432 event pairs, 1144 based on Foata normal form. 6/7133 useless extension candidates. Maximal degree in co-relation 60519. Up to 3207 conditions per place. [2023-01-27 20:50:14,585 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 333 selfloop transitions, 126 changer transitions 11/470 dead transitions. [2023-01-27 20:50:14,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 470 transitions, 8590 flow [2023-01-27 20:50:14,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 20:50:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 20:50:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 612 transitions. [2023-01-27 20:50:14,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.477751756440281 [2023-01-27 20:50:14,587 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 612 transitions. [2023-01-27 20:50:14,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 612 transitions. [2023-01-27 20:50:14,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:14,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 612 transitions. [2023-01-27 20:50:14,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.42857142857143) internal successors, (612), 7 states have internal predecessors, (612), 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) [2023-01-27 20:50:14,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:14,590 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:14,590 INFO L175 Difference]: Start difference. First operand has 169 places, 381 transitions, 6500 flow. Second operand 7 states and 612 transitions. [2023-01-27 20:50:14,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 470 transitions, 8590 flow [2023-01-27 20:50:14,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 470 transitions, 8580 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-01-27 20:50:15,003 INFO L231 Difference]: Finished difference. Result has 179 places, 395 transitions, 7216 flow [2023-01-27 20:50:15,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=6463, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7216, PETRI_PLACES=179, PETRI_TRANSITIONS=395} [2023-01-27 20:50:15,004 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 150 predicate places. [2023-01-27 20:50:15,004 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 395 transitions, 7216 flow [2023-01-27 20:50:15,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:50:15,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:15,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:15,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 20:50:15,005 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 1 more)] === [2023-01-27 20:50:15,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:15,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1078465141, now seen corresponding path program 7 times [2023-01-27 20:50:15,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:15,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159261534] [2023-01-27 20:50:15,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:15,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:15,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:15,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159261534] [2023-01-27 20:50:15,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159261534] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:50:15,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280583637] [2023-01-27 20:50:15,134 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 20:50:15,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:50:15,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:50:15,135 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) [2023-01-27 20:50:15,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-27 20:50:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:15,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-27 20:50:15,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:50:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:15,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:50:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:15,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280583637] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 20:50:15,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 20:50:15,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 15 [2023-01-27 20:50:15,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814816361] [2023-01-27 20:50:15,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:50:15,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 20:50:15,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:15,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 20:50:15,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2023-01-27 20:50:15,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 183 [2023-01-27 20:50:15,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 395 transitions, 7216 flow. Second operand has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2023-01-27 20:50:15,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:15,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 183 [2023-01-27 20:50:15,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:16,511 INFO L130 PetriNetUnfolder]: 4300/6959 cut-off events. [2023-01-27 20:50:16,511 INFO L131 PetriNetUnfolder]: For 188997/189165 co-relation queries the response was YES. [2023-01-27 20:50:16,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62550 conditions, 6959 events. 4300/6959 cut-off events. For 188997/189165 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 43680 event pairs, 1242 based on Foata normal form. 39/6958 useless extension candidates. Maximal degree in co-relation 60972. Up to 3106 conditions per place. [2023-01-27 20:50:16,571 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 367 selfloop transitions, 83 changer transitions 1/461 dead transitions. [2023-01-27 20:50:16,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 461 transitions, 8841 flow [2023-01-27 20:50:16,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 20:50:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 20:50:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions. [2023-01-27 20:50:16,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972677595628415 [2023-01-27 20:50:16,572 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 546 transitions. [2023-01-27 20:50:16,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 546 transitions. [2023-01-27 20:50:16,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:16,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 546 transitions. [2023-01-27 20:50:16,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 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) [2023-01-27 20:50:16,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 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) [2023-01-27 20:50:16,575 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 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) [2023-01-27 20:50:16,575 INFO L175 Difference]: Start difference. First operand has 179 places, 395 transitions, 7216 flow. Second operand 6 states and 546 transitions. [2023-01-27 20:50:16,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 461 transitions, 8841 flow [2023-01-27 20:50:17,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 461 transitions, 8781 flow, removed 30 selfloop flow, removed 0 redundant places. [2023-01-27 20:50:17,090 INFO L231 Difference]: Finished difference. Result has 186 places, 398 transitions, 7434 flow [2023-01-27 20:50:17,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=7156, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7434, PETRI_PLACES=186, PETRI_TRANSITIONS=398} [2023-01-27 20:50:17,090 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 157 predicate places. [2023-01-27 20:50:17,091 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 398 transitions, 7434 flow [2023-01-27 20:50:17,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2023-01-27 20:50:17,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:17,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:17,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-27 20:50:17,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:50:17,291 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 1 more)] === [2023-01-27 20:50:17,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:17,292 INFO L85 PathProgramCache]: Analyzing trace with hash 922278681, now seen corresponding path program 4 times [2023-01-27 20:50:17,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:17,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745083831] [2023-01-27 20:50:17,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:17,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:17,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:17,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745083831] [2023-01-27 20:50:17,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745083831] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:50:17,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:50:17,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 20:50:17,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339688443] [2023-01-27 20:50:17,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:50:17,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 20:50:17,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:17,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 20:50:17,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 20:50:17,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:50:17,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 398 transitions, 7434 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:50:17,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:17,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:50:17,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:18,564 INFO L130 PetriNetUnfolder]: 4542/7348 cut-off events. [2023-01-27 20:50:18,565 INFO L131 PetriNetUnfolder]: For 203641/203641 co-relation queries the response was YES. [2023-01-27 20:50:18,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66953 conditions, 7348 events. 4542/7348 cut-off events. For 203641/203641 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 46592 event pairs, 1384 based on Foata normal form. 36/7372 useless extension candidates. Maximal degree in co-relation 65305. Up to 4262 conditions per place. [2023-01-27 20:50:18,618 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 424 selfloop transitions, 79 changer transitions 14/517 dead transitions. [2023-01-27 20:50:18,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 517 transitions, 10211 flow [2023-01-27 20:50:18,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 20:50:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 20:50:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 605 transitions. [2023-01-27 20:50:18,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722872755659641 [2023-01-27 20:50:18,619 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 605 transitions. [2023-01-27 20:50:18,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 605 transitions. [2023-01-27 20:50:18,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:18,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 605 transitions. [2023-01-27 20:50:18,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 86.42857142857143) internal successors, (605), 7 states have internal predecessors, (605), 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) [2023-01-27 20:50:18,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:18,622 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:18,622 INFO L175 Difference]: Start difference. First operand has 186 places, 398 transitions, 7434 flow. Second operand 7 states and 605 transitions. [2023-01-27 20:50:18,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 517 transitions, 10211 flow [2023-01-27 20:50:19,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 517 transitions, 10075 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-01-27 20:50:19,058 INFO L231 Difference]: Finished difference. Result has 193 places, 406 transitions, 7697 flow [2023-01-27 20:50:19,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=7273, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7697, PETRI_PLACES=193, PETRI_TRANSITIONS=406} [2023-01-27 20:50:19,059 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 164 predicate places. [2023-01-27 20:50:19,059 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 406 transitions, 7697 flow [2023-01-27 20:50:19,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:50:19,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:19,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:19,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 20:50:19,059 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 1 more)] === [2023-01-27 20:50:19,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:19,060 INFO L85 PathProgramCache]: Analyzing trace with hash 252443957, now seen corresponding path program 5 times [2023-01-27 20:50:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107907211] [2023-01-27 20:50:19,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:19,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:19,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:19,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107907211] [2023-01-27 20:50:19,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107907211] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:50:19,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455865303] [2023-01-27 20:50:19,158 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 20:50:19,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:50:19,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:50:19,159 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 20:50:19,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-27 20:50:19,237 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 20:50:19,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:50:19,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-27 20:50:19,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:50:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:19,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:50:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:19,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455865303] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:50:19,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:50:19,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-01-27 20:50:19,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034549920] [2023-01-27 20:50:19,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:50:19,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 20:50:19,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:19,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 20:50:19,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-01-27 20:50:19,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:50:19,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 406 transitions, 7697 flow. Second operand has 11 states, 11 states have (on average 77.45454545454545) internal successors, (852), 11 states have internal predecessors, (852), 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) [2023-01-27 20:50:19,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:19,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:50:19,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:20,738 INFO L130 PetriNetUnfolder]: 4489/7229 cut-off events. [2023-01-27 20:50:20,738 INFO L131 PetriNetUnfolder]: For 203655/203655 co-relation queries the response was YES. [2023-01-27 20:50:20,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66691 conditions, 7229 events. 4489/7229 cut-off events. For 203655/203655 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 45252 event pairs, 1394 based on Foata normal form. 16/7233 useless extension candidates. Maximal degree in co-relation 66281. Up to 4262 conditions per place. [2023-01-27 20:50:20,807 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 422 selfloop transitions, 85 changer transitions 2/509 dead transitions. [2023-01-27 20:50:20,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 509 transitions, 10206 flow [2023-01-27 20:50:20,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 20:50:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 20:50:20,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 603 transitions. [2023-01-27 20:50:20,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707259953161593 [2023-01-27 20:50:20,809 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 603 transitions. [2023-01-27 20:50:20,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 603 transitions. [2023-01-27 20:50:20,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:20,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 603 transitions. [2023-01-27 20:50:20,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 86.14285714285714) internal successors, (603), 7 states have internal predecessors, (603), 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) [2023-01-27 20:50:20,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:20,811 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:20,811 INFO L175 Difference]: Start difference. First operand has 193 places, 406 transitions, 7697 flow. Second operand 7 states and 603 transitions. [2023-01-27 20:50:20,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 509 transitions, 10206 flow [2023-01-27 20:50:21,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 509 transitions, 10026 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-01-27 20:50:21,460 INFO L231 Difference]: Finished difference. Result has 197 places, 412 transitions, 7879 flow [2023-01-27 20:50:21,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=7510, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7879, PETRI_PLACES=197, PETRI_TRANSITIONS=412} [2023-01-27 20:50:21,461 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 168 predicate places. [2023-01-27 20:50:21,461 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 412 transitions, 7879 flow [2023-01-27 20:50:21,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 77.45454545454545) internal successors, (852), 11 states have internal predecessors, (852), 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) [2023-01-27 20:50:21,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:21,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:21,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-27 20:50:21,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-01-27 20:50:21,665 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 1 more)] === [2023-01-27 20:50:21,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:21,665 INFO L85 PathProgramCache]: Analyzing trace with hash -522852095, now seen corresponding path program 8 times [2023-01-27 20:50:21,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:21,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803486347] [2023-01-27 20:50:21,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:21,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:21,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:21,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803486347] [2023-01-27 20:50:21,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803486347] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:50:21,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065346547] [2023-01-27 20:50:21,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 20:50:21,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:50:21,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:50:21,802 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 20:50:21,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-27 20:50:21,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 20:50:21,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:50:21,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-27 20:50:21,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:50:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:21,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:50:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:22,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065346547] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 20:50:22,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 20:50:22,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 15 [2023-01-27 20:50:22,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831227303] [2023-01-27 20:50:22,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:50:22,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 20:50:22,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:22,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 20:50:22,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-01-27 20:50:22,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 183 [2023-01-27 20:50:22,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 412 transitions, 7879 flow. Second operand has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2023-01-27 20:50:22,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:22,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 183 [2023-01-27 20:50:22,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:23,332 INFO L130 PetriNetUnfolder]: 4367/7041 cut-off events. [2023-01-27 20:50:23,333 INFO L131 PetriNetUnfolder]: For 201238/201388 co-relation queries the response was YES. [2023-01-27 20:50:23,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65182 conditions, 7041 events. 4367/7041 cut-off events. For 201238/201388 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 44010 event pairs, 1307 based on Foata normal form. 35/7036 useless extension candidates. Maximal degree in co-relation 64497. Up to 3106 conditions per place. [2023-01-27 20:50:23,392 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 378 selfloop transitions, 82 changer transitions 1/471 dead transitions. [2023-01-27 20:50:23,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 471 transitions, 9470 flow [2023-01-27 20:50:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 20:50:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 20:50:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2023-01-27 20:50:23,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4936247723132969 [2023-01-27 20:50:23,393 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 542 transitions. [2023-01-27 20:50:23,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 542 transitions. [2023-01-27 20:50:23,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:23,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 542 transitions. [2023-01-27 20:50:23,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 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) [2023-01-27 20:50:23,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 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) [2023-01-27 20:50:23,395 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 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) [2023-01-27 20:50:23,396 INFO L175 Difference]: Start difference. First operand has 197 places, 412 transitions, 7879 flow. Second operand 6 states and 542 transitions. [2023-01-27 20:50:23,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 471 transitions, 9470 flow [2023-01-27 20:50:23,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 471 transitions, 9306 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-01-27 20:50:23,909 INFO L231 Difference]: Finished difference. Result has 201 places, 413 transitions, 7921 flow [2023-01-27 20:50:23,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=7715, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7921, PETRI_PLACES=201, PETRI_TRANSITIONS=413} [2023-01-27 20:50:23,909 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 172 predicate places. [2023-01-27 20:50:23,909 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 413 transitions, 7921 flow [2023-01-27 20:50:23,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2023-01-27 20:50:23,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:23,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:23,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-01-27 20:50:24,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-27 20:50:24,114 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 1 more)] === [2023-01-27 20:50:24,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:24,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1350794939, now seen corresponding path program 1 times [2023-01-27 20:50:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:24,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183771222] [2023-01-27 20:50:24,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:24,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:24,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:24,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183771222] [2023-01-27 20:50:24,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183771222] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:50:24,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:50:24,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 20:50:24,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095530363] [2023-01-27 20:50:24,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:50:24,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 20:50:24,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:24,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 20:50:24,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 20:50:24,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:50:24,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 413 transitions, 7921 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:50:24,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:24,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:50:24,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:25,611 INFO L130 PetriNetUnfolder]: 4701/7587 cut-off events. [2023-01-27 20:50:25,611 INFO L131 PetriNetUnfolder]: For 219294/219294 co-relation queries the response was YES. [2023-01-27 20:50:25,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70226 conditions, 7587 events. 4701/7587 cut-off events. For 219294/219294 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 48076 event pairs, 1479 based on Foata normal form. 28/7603 useless extension candidates. Maximal degree in co-relation 69308. Up to 4230 conditions per place. [2023-01-27 20:50:25,667 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 383 selfloop transitions, 132 changer transitions 9/524 dead transitions. [2023-01-27 20:50:25,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 524 transitions, 10627 flow [2023-01-27 20:50:25,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 20:50:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 20:50:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 606 transitions. [2023-01-27 20:50:25,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47306791569086654 [2023-01-27 20:50:25,668 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 606 transitions. [2023-01-27 20:50:25,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 606 transitions. [2023-01-27 20:50:25,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:25,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 606 transitions. [2023-01-27 20:50:25,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 86.57142857142857) internal successors, (606), 7 states have internal predecessors, (606), 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) [2023-01-27 20:50:25,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:25,671 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:25,671 INFO L175 Difference]: Start difference. First operand has 201 places, 413 transitions, 7921 flow. Second operand 7 states and 606 transitions. [2023-01-27 20:50:25,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 524 transitions, 10627 flow [2023-01-27 20:50:26,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 524 transitions, 10497 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-27 20:50:26,200 INFO L231 Difference]: Finished difference. Result has 210 places, 442 transitions, 8929 flow [2023-01-27 20:50:26,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=7799, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8929, PETRI_PLACES=210, PETRI_TRANSITIONS=442} [2023-01-27 20:50:26,200 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 181 predicate places. [2023-01-27 20:50:26,201 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 442 transitions, 8929 flow [2023-01-27 20:50:26,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:50:26,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:26,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:26,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 20:50:26,201 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 1 more)] === [2023-01-27 20:50:26,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:26,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1162807863, now seen corresponding path program 2 times [2023-01-27 20:50:26,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:26,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961370420] [2023-01-27 20:50:26,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:26,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:26,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:26,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961370420] [2023-01-27 20:50:26,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961370420] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:50:26,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:50:26,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 20:50:26,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321137693] [2023-01-27 20:50:26,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:50:26,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 20:50:26,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:26,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 20:50:26,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-27 20:50:26,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:50:26,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 442 transitions, 8929 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:50:26,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:26,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:50:26,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:27,809 INFO L130 PetriNetUnfolder]: 4771/7753 cut-off events. [2023-01-27 20:50:27,809 INFO L131 PetriNetUnfolder]: For 245862/245862 co-relation queries the response was YES. [2023-01-27 20:50:27,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74018 conditions, 7753 events. 4771/7753 cut-off events. For 245862/245862 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 50054 event pairs, 1027 based on Foata normal form. 24/7763 useless extension candidates. Maximal degree in co-relation 73606. Up to 4016 conditions per place. [2023-01-27 20:50:27,873 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 424 selfloop transitions, 195 changer transitions 9/628 dead transitions. [2023-01-27 20:50:27,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 628 transitions, 13104 flow [2023-01-27 20:50:27,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 20:50:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 20:50:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 593 transitions. [2023-01-27 20:50:27,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46291959406713507 [2023-01-27 20:50:27,876 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 593 transitions. [2023-01-27 20:50:27,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 593 transitions. [2023-01-27 20:50:27,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:27,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 593 transitions. [2023-01-27 20:50:27,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.71428571428571) internal successors, (593), 7 states have internal predecessors, (593), 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) [2023-01-27 20:50:27,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:27,878 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:27,878 INFO L175 Difference]: Start difference. First operand has 210 places, 442 transitions, 8929 flow. Second operand 7 states and 593 transitions. [2023-01-27 20:50:27,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 628 transitions, 13104 flow [2023-01-27 20:50:28,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 628 transitions, 13028 flow, removed 38 selfloop flow, removed 1 redundant places. [2023-01-27 20:50:28,624 INFO L231 Difference]: Finished difference. Result has 219 places, 463 transitions, 10018 flow [2023-01-27 20:50:28,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=8859, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10018, PETRI_PLACES=219, PETRI_TRANSITIONS=463} [2023-01-27 20:50:28,624 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 190 predicate places. [2023-01-27 20:50:28,625 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 463 transitions, 10018 flow [2023-01-27 20:50:28,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:50:28,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:28,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:28,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-27 20:50:28,625 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 1 more)] === [2023-01-27 20:50:28,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:28,626 INFO L85 PathProgramCache]: Analyzing trace with hash -331942833, now seen corresponding path program 6 times [2023-01-27 20:50:28,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:28,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494251395] [2023-01-27 20:50:28,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:28,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:28,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:28,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494251395] [2023-01-27 20:50:28,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494251395] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:50:28,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296453155] [2023-01-27 20:50:28,810 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 20:50:28,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:50:28,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:50:28,811 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 20:50:28,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-27 20:50:28,883 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-27 20:50:28,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:50:28,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-27 20:50:28,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:50:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:29,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:50:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:29,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296453155] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 20:50:29,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 20:50:29,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 8] total 17 [2023-01-27 20:50:29,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316492821] [2023-01-27 20:50:29,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:50:29,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 20:50:29,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:29,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 20:50:29,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-01-27 20:50:29,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:50:29,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 463 transitions, 10018 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:50:29,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:29,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:50:29,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:30,777 INFO L130 PetriNetUnfolder]: 5029/8148 cut-off events. [2023-01-27 20:50:30,778 INFO L131 PetriNetUnfolder]: For 283318/283318 co-relation queries the response was YES. [2023-01-27 20:50:30,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81752 conditions, 8148 events. 5029/8148 cut-off events. For 283318/283318 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 52481 event pairs, 1005 based on Foata normal form. 4/8138 useless extension candidates. Maximal degree in co-relation 80820. Up to 3340 conditions per place. [2023-01-27 20:50:30,855 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 347 selfloop transitions, 232 changer transitions 3/582 dead transitions. [2023-01-27 20:50:30,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 582 transitions, 13171 flow [2023-01-27 20:50:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 20:50:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 20:50:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 613 transitions. [2023-01-27 20:50:30,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785323965651834 [2023-01-27 20:50:30,857 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 613 transitions. [2023-01-27 20:50:30,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 613 transitions. [2023-01-27 20:50:30,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:30,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 613 transitions. [2023-01-27 20:50:30,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 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) [2023-01-27 20:50:30,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:30,859 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:30,859 INFO L175 Difference]: Start difference. First operand has 219 places, 463 transitions, 10018 flow. Second operand 7 states and 613 transitions. [2023-01-27 20:50:30,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 582 transitions, 13171 flow [2023-01-27 20:50:31,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 582 transitions, 12803 flow, removed 99 selfloop flow, removed 2 redundant places. [2023-01-27 20:50:31,787 INFO L231 Difference]: Finished difference. Result has 227 places, 498 transitions, 11333 flow [2023-01-27 20:50:31,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=9655, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11333, PETRI_PLACES=227, PETRI_TRANSITIONS=498} [2023-01-27 20:50:31,787 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 198 predicate places. [2023-01-27 20:50:31,787 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 498 transitions, 11333 flow [2023-01-27 20:50:31,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:50:31,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:31,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:31,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-27 20:50:31,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-27 20:50:31,991 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 1 more)] === [2023-01-27 20:50:31,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:31,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2060766139, now seen corresponding path program 3 times [2023-01-27 20:50:31,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:31,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778277660] [2023-01-27 20:50:31,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:31,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:32,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:32,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778277660] [2023-01-27 20:50:32,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778277660] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:50:32,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:50:32,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 20:50:32,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67362422] [2023-01-27 20:50:32,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:50:32,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 20:50:32,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:32,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 20:50:32,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-27 20:50:32,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:50:32,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 498 transitions, 11333 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:50:32,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:32,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:50:32,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:33,757 INFO L130 PetriNetUnfolder]: 5037/8246 cut-off events. [2023-01-27 20:50:33,757 INFO L131 PetriNetUnfolder]: For 319407/319407 co-relation queries the response was YES. [2023-01-27 20:50:33,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84228 conditions, 8246 events. 5037/8246 cut-off events. For 319407/319407 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 53994 event pairs, 1430 based on Foata normal form. 28/8260 useless extension candidates. Maximal degree in co-relation 83095. Up to 4490 conditions per place. [2023-01-27 20:50:33,836 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 351 selfloop transitions, 219 changer transitions 9/579 dead transitions. [2023-01-27 20:50:33,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 579 transitions, 13711 flow [2023-01-27 20:50:33,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 20:50:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 20:50:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 596 transitions. [2023-01-27 20:50:33,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652615144418423 [2023-01-27 20:50:33,838 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 596 transitions. [2023-01-27 20:50:33,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 596 transitions. [2023-01-27 20:50:33,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:33,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 596 transitions. [2023-01-27 20:50:33,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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) [2023-01-27 20:50:33,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:33,840 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:33,840 INFO L175 Difference]: Start difference. First operand has 227 places, 498 transitions, 11333 flow. Second operand 7 states and 596 transitions. [2023-01-27 20:50:33,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 579 transitions, 13711 flow [2023-01-27 20:50:34,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 579 transitions, 13471 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-01-27 20:50:34,841 INFO L231 Difference]: Finished difference. Result has 236 places, 515 transitions, 12221 flow [2023-01-27 20:50:34,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=11099, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12221, PETRI_PLACES=236, PETRI_TRANSITIONS=515} [2023-01-27 20:50:34,841 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 207 predicate places. [2023-01-27 20:50:34,841 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 515 transitions, 12221 flow [2023-01-27 20:50:34,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:50:34,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:34,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:34,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-27 20:50:34,842 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 1 more)] === [2023-01-27 20:50:34,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash 986185829, now seen corresponding path program 9 times [2023-01-27 20:50:34,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:34,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888139673] [2023-01-27 20:50:34,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:34,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:34,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888139673] [2023-01-27 20:50:34,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888139673] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:50:34,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831072759] [2023-01-27 20:50:34,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 20:50:34,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:50:34,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:50:34,983 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 20:50:34,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-27 20:50:35,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 20:50:35,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:50:35,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-27 20:50:35,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:50:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:35,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:50:35,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:35,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831072759] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 20:50:35,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 20:50:35,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 10 [2023-01-27 20:50:35,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213340254] [2023-01-27 20:50:35,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:50:35,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 20:50:35,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:35,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 20:50:35,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-01-27 20:50:35,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 183 [2023-01-27 20:50:35,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 515 transitions, 12221 flow. Second operand has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2023-01-27 20:50:35,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:35,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 183 [2023-01-27 20:50:35,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:37,021 INFO L130 PetriNetUnfolder]: 4932/8084 cut-off events. [2023-01-27 20:50:37,021 INFO L131 PetriNetUnfolder]: For 325399/325633 co-relation queries the response was YES. [2023-01-27 20:50:37,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85078 conditions, 8084 events. 4932/8084 cut-off events. For 325399/325633 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 53066 event pairs, 1524 based on Foata normal form. 29/8062 useless extension candidates. Maximal degree in co-relation 84620. Up to 4041 conditions per place. [2023-01-27 20:50:37,095 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 430 selfloop transitions, 121 changer transitions 1/575 dead transitions. [2023-01-27 20:50:37,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 575 transitions, 14117 flow [2023-01-27 20:50:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 20:50:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 20:50:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2023-01-27 20:50:37,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918032786885246 [2023-01-27 20:50:37,097 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2023-01-27 20:50:37,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2023-01-27 20:50:37,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:37,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2023-01-27 20:50:37,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 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) [2023-01-27 20:50:37,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 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) [2023-01-27 20:50:37,099 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 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) [2023-01-27 20:50:37,099 INFO L175 Difference]: Start difference. First operand has 236 places, 515 transitions, 12221 flow. Second operand 6 states and 540 transitions. [2023-01-27 20:50:37,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 575 transitions, 14117 flow [2023-01-27 20:50:38,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 575 transitions, 13784 flow, removed 79 selfloop flow, removed 2 redundant places. [2023-01-27 20:50:38,144 INFO L231 Difference]: Finished difference. Result has 241 places, 517 transitions, 12237 flow [2023-01-27 20:50:38,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=11888, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12237, PETRI_PLACES=241, PETRI_TRANSITIONS=517} [2023-01-27 20:50:38,144 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 212 predicate places. [2023-01-27 20:50:38,144 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 517 transitions, 12237 flow [2023-01-27 20:50:38,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2023-01-27 20:50:38,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:38,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:38,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-01-27 20:50:38,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:50:38,349 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 1 more)] === [2023-01-27 20:50:38,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:38,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1237459589, now seen corresponding path program 4 times [2023-01-27 20:50:38,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:38,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262217496] [2023-01-27 20:50:38,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:38,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:38,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:38,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262217496] [2023-01-27 20:50:38,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262217496] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:50:38,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:50:38,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 20:50:38,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469816275] [2023-01-27 20:50:38,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:50:38,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 20:50:38,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:38,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 20:50:38,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 20:50:38,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:50:38,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 517 transitions, 12237 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:50:38,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:38,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:50:38,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:40,210 INFO L130 PetriNetUnfolder]: 4992/8138 cut-off events. [2023-01-27 20:50:40,211 INFO L131 PetriNetUnfolder]: For 316761/316761 co-relation queries the response was YES. [2023-01-27 20:50:40,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84685 conditions, 8138 events. 4992/8138 cut-off events. For 316761/316761 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 52904 event pairs, 1447 based on Foata normal form. 12/8136 useless extension candidates. Maximal degree in co-relation 83575. Up to 4268 conditions per place. [2023-01-27 20:50:40,279 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 448 selfloop transitions, 139 changer transitions 14/601 dead transitions. [2023-01-27 20:50:40,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 601 transitions, 14630 flow [2023-01-27 20:50:40,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 20:50:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 20:50:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 600 transitions. [2023-01-27 20:50:40,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.468384074941452 [2023-01-27 20:50:40,281 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 600 transitions. [2023-01-27 20:50:40,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 600 transitions. [2023-01-27 20:50:40,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:40,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 600 transitions. [2023-01-27 20:50:40,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 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) [2023-01-27 20:50:40,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:40,282 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:50:40,283 INFO L175 Difference]: Start difference. First operand has 241 places, 517 transitions, 12237 flow. Second operand 7 states and 600 transitions. [2023-01-27 20:50:40,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 601 transitions, 14630 flow [2023-01-27 20:50:41,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 601 transitions, 14417 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-01-27 20:50:41,201 INFO L231 Difference]: Finished difference. Result has 248 places, 517 transitions, 12341 flow [2023-01-27 20:50:41,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=12024, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12341, PETRI_PLACES=248, PETRI_TRANSITIONS=517} [2023-01-27 20:50:41,202 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 219 predicate places. [2023-01-27 20:50:41,202 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 517 transitions, 12341 flow [2023-01-27 20:50:41,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:50:41,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:41,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:41,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-01-27 20:50:41,202 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 1 more)] === [2023-01-27 20:50:41,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:41,203 INFO L85 PathProgramCache]: Analyzing trace with hash 594068329, now seen corresponding path program 7 times [2023-01-27 20:50:41,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:41,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80300294] [2023-01-27 20:50:41,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:41,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:41,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:41,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80300294] [2023-01-27 20:50:41,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80300294] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:50:41,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413006593] [2023-01-27 20:50:41,297 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 20:50:41,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:50:41,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:50:41,298 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 20:50:41,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-27 20:50:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:41,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-27 20:50:41,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:50:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:41,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:50:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:41,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413006593] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:50:41,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:50:41,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-01-27 20:50:41,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779887879] [2023-01-27 20:50:41,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:50:41,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 20:50:41,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:41,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 20:50:41,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-01-27 20:50:41,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:50:41,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 517 transitions, 12341 flow. Second operand has 11 states, 11 states have (on average 77.45454545454545) internal successors, (852), 11 states have internal predecessors, (852), 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) [2023-01-27 20:50:41,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:41,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:50:41,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:43,885 INFO L130 PetriNetUnfolder]: 5484/8976 cut-off events. [2023-01-27 20:50:43,885 INFO L131 PetriNetUnfolder]: For 348249/348249 co-relation queries the response was YES. [2023-01-27 20:50:43,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93318 conditions, 8976 events. 5484/8976 cut-off events. For 348249/348249 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 59667 event pairs, 1172 based on Foata normal form. 38/9000 useless extension candidates. Maximal degree in co-relation 92874. Up to 3516 conditions per place. [2023-01-27 20:50:43,969 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 376 selfloop transitions, 300 changer transitions 5/681 dead transitions. [2023-01-27 20:50:43,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 681 transitions, 16220 flow [2023-01-27 20:50:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-27 20:50:43,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-27 20:50:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 974 transitions. [2023-01-27 20:50:43,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4838549428713363 [2023-01-27 20:50:43,974 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 974 transitions. [2023-01-27 20:50:43,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 974 transitions. [2023-01-27 20:50:43,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:43,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 974 transitions. [2023-01-27 20:50:43,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.54545454545455) internal successors, (974), 11 states have internal predecessors, (974), 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) [2023-01-27 20:50:43,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 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) [2023-01-27 20:50:43,976 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 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) [2023-01-27 20:50:43,976 INFO L175 Difference]: Start difference. First operand has 248 places, 517 transitions, 12341 flow. Second operand 11 states and 974 transitions. [2023-01-27 20:50:43,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 681 transitions, 16220 flow [2023-01-27 20:50:45,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 681 transitions, 15902 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-01-27 20:50:45,275 INFO L231 Difference]: Finished difference. Result has 255 places, 545 transitions, 13557 flow [2023-01-27 20:50:45,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=12041, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=272, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13557, PETRI_PLACES=255, PETRI_TRANSITIONS=545} [2023-01-27 20:50:45,276 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 226 predicate places. [2023-01-27 20:50:45,276 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 545 transitions, 13557 flow [2023-01-27 20:50:45,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 77.45454545454545) internal successors, (852), 11 states have internal predecessors, (852), 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) [2023-01-27 20:50:45,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:45,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:45,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-27 20:50:45,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-01-27 20:50:45,477 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 1 more)] === [2023-01-27 20:50:45,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:45,477 INFO L85 PathProgramCache]: Analyzing trace with hash -24418865, now seen corresponding path program 10 times [2023-01-27 20:50:45,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:45,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811248042] [2023-01-27 20:50:45,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:45,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:45,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:45,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811248042] [2023-01-27 20:50:45,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811248042] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:50:45,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688488877] [2023-01-27 20:50:45,576 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 20:50:45,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:50:45,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:50:45,577 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 20:50:45,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-27 20:50:45,668 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 20:50:45,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:50:45,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-27 20:50:45,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:50:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:45,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:50:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:46,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688488877] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:50:46,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:50:46,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 14 [2023-01-27 20:50:46,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510608131] [2023-01-27 20:50:46,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:50:46,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-27 20:50:46,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:46,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-27 20:50:46,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-01-27 20:50:46,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:50:46,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 545 transitions, 13557 flow. Second operand has 14 states, 14 states have (on average 77.28571428571429) internal successors, (1082), 14 states have internal predecessors, (1082), 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) [2023-01-27 20:50:46,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:46,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:50:46,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:49,386 INFO L130 PetriNetUnfolder]: 6884/11296 cut-off events. [2023-01-27 20:50:49,386 INFO L131 PetriNetUnfolder]: For 454386/454386 co-relation queries the response was YES. [2023-01-27 20:50:49,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118897 conditions, 11296 events. 6884/11296 cut-off events. For 454386/454386 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 78764 event pairs, 1584 based on Foata normal form. 54/11336 useless extension candidates. Maximal degree in co-relation 117850. Up to 4440 conditions per place. [2023-01-27 20:50:49,495 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 600 selfloop transitions, 289 changer transitions 8/897 dead transitions. [2023-01-27 20:50:49,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 897 transitions, 21861 flow [2023-01-27 20:50:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-01-27 20:50:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-01-27 20:50:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1720 transitions. [2023-01-27 20:50:49,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46994535519125685 [2023-01-27 20:50:49,498 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1720 transitions. [2023-01-27 20:50:49,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1720 transitions. [2023-01-27 20:50:49,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:49,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1720 transitions. [2023-01-27 20:50:49,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 86.0) internal successors, (1720), 20 states have internal predecessors, (1720), 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) [2023-01-27 20:50:49,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 183.0) internal successors, (3843), 21 states have internal predecessors, (3843), 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) [2023-01-27 20:50:49,502 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 183.0) internal successors, (3843), 21 states have internal predecessors, (3843), 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) [2023-01-27 20:50:49,502 INFO L175 Difference]: Start difference. First operand has 255 places, 545 transitions, 13557 flow. Second operand 20 states and 1720 transitions. [2023-01-27 20:50:49,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 897 transitions, 21861 flow [2023-01-27 20:50:51,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 897 transitions, 21367 flow, removed 42 selfloop flow, removed 3 redundant places. [2023-01-27 20:50:51,408 INFO L231 Difference]: Finished difference. Result has 285 places, 656 transitions, 16748 flow [2023-01-27 20:50:51,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=13184, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=16748, PETRI_PLACES=285, PETRI_TRANSITIONS=656} [2023-01-27 20:50:51,409 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 256 predicate places. [2023-01-27 20:50:51,409 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 656 transitions, 16748 flow [2023-01-27 20:50:51,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 77.28571428571429) internal successors, (1082), 14 states have internal predecessors, (1082), 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) [2023-01-27 20:50:51,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:50:51,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:50:51,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-01-27 20:50:51,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-01-27 20:50:51,617 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 1 more)] === [2023-01-27 20:50:51,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:50:51,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1922737153, now seen corresponding path program 11 times [2023-01-27 20:50:51,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:50:51,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714961297] [2023-01-27 20:50:51,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:50:51,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:50:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:50:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:51,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:50:51,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714961297] [2023-01-27 20:50:51,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714961297] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:50:51,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53639372] [2023-01-27 20:50:51,783 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 20:50:51,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:50:51,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:50:51,784 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 20:50:51,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-27 20:50:51,864 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 20:50:51,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:50:51,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-27 20:50:51,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:50:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:51,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:50:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:50:52,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53639372] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:50:52,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:50:52,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 15 [2023-01-27 20:50:52,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98144872] [2023-01-27 20:50:52,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:50:52,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-27 20:50:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:50:52,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-27 20:50:52,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-01-27 20:50:52,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:50:52,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 656 transitions, 16748 flow. Second operand has 15 states, 15 states have (on average 77.4) internal successors, (1161), 15 states have internal predecessors, (1161), 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) [2023-01-27 20:50:52,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:50:52,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:50:52,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:50:56,366 INFO L130 PetriNetUnfolder]: 9225/15211 cut-off events. [2023-01-27 20:50:56,366 INFO L131 PetriNetUnfolder]: For 683011/683011 co-relation queries the response was YES. [2023-01-27 20:50:56,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166955 conditions, 15211 events. 9225/15211 cut-off events. For 683011/683011 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 111891 event pairs, 1688 based on Foata normal form. 56/15253 useless extension candidates. Maximal degree in co-relation 165884. Up to 5886 conditions per place. [2023-01-27 20:50:56,529 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 581 selfloop transitions, 541 changer transitions 6/1128 dead transitions. [2023-01-27 20:50:56,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 1128 transitions, 27524 flow [2023-01-27 20:50:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-01-27 20:50:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-01-27 20:50:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2155 transitions. [2023-01-27 20:50:56,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4710382513661202 [2023-01-27 20:50:56,531 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2155 transitions. [2023-01-27 20:50:56,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2155 transitions. [2023-01-27 20:50:56,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:50:56,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2155 transitions. [2023-01-27 20:50:56,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 86.2) internal successors, (2155), 25 states have internal predecessors, (2155), 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) [2023-01-27 20:50:56,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 183.0) internal successors, (4758), 26 states have internal predecessors, (4758), 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) [2023-01-27 20:50:56,537 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 183.0) internal successors, (4758), 26 states have internal predecessors, (4758), 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) [2023-01-27 20:50:56,537 INFO L175 Difference]: Start difference. First operand has 285 places, 656 transitions, 16748 flow. Second operand 25 states and 2155 transitions. [2023-01-27 20:50:56,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 1128 transitions, 27524 flow [2023-01-27 20:51:00,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 1128 transitions, 27032 flow, removed 246 selfloop flow, removed 0 redundant places. [2023-01-27 20:51:00,145 INFO L231 Difference]: Finished difference. Result has 329 places, 814 transitions, 22264 flow [2023-01-27 20:51:00,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=16416, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=407, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=22264, PETRI_PLACES=329, PETRI_TRANSITIONS=814} [2023-01-27 20:51:00,145 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 300 predicate places. [2023-01-27 20:51:00,145 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 814 transitions, 22264 flow [2023-01-27 20:51:00,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 77.4) internal successors, (1161), 15 states have internal predecessors, (1161), 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) [2023-01-27 20:51:00,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:51:00,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:51:00,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-01-27 20:51:00,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:51:00,350 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 1 more)] === [2023-01-27 20:51:00,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:51:00,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1855123861, now seen corresponding path program 12 times [2023-01-27 20:51:00,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:51:00,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515466695] [2023-01-27 20:51:00,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:51:00,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:51:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:51:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:51:00,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:51:00,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515466695] [2023-01-27 20:51:00,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515466695] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:51:00,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008253965] [2023-01-27 20:51:00,460 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 20:51:00,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:51:00,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:51:00,461 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 20:51:00,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-27 20:51:00,549 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-27 20:51:00,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:51:00,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-27 20:51:00,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:51:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:51:00,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:51:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:51:04,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008253965] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:51:04,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:51:04,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 15 [2023-01-27 20:51:04,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174400842] [2023-01-27 20:51:04,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:51:04,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-27 20:51:04,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:51:04,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-27 20:51:04,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=159, Unknown=2, NotChecked=0, Total=210 [2023-01-27 20:51:04,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:51:04,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 814 transitions, 22264 flow. Second operand has 15 states, 15 states have (on average 77.53333333333333) internal successors, (1163), 15 states have internal predecessors, (1163), 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) [2023-01-27 20:51:04,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:51:04,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:51:04,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:51:07,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:09,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:11,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:13,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:15,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:17,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:19,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:22,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:24,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:26,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:28,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:30,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:32,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:34,248 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296)) (.cse0 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296))) (and (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse1 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 .cse0) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse1) (< .cse1 0) (let ((.cse3 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ .cse2 (* (div .cse3 4294967296) 4294967296)) .cse3)) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (or (let ((.cse4 (* 4294967295 c_~a~0))) (< (+ .cse2 (* (div .cse4 4294967296) 4294967296)) .cse4)) (< .cse0 (mod c_~a~0 4294967296))))) is different from false [2023-01-27 20:51:36,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:38,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:40,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:42,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:44,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:46,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:48,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:50,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:52,721 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296))) (and (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse0 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse0) (< .cse0 0) (let ((.cse2 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ .cse1 (* (div .cse2 4294967296) 4294967296)) .cse2)) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (let ((.cse3 (* 4294967295 c_~a~0))) (< (+ .cse1 (* (div .cse3 4294967296) 4294967296)) .cse3)))) is different from false [2023-01-27 20:51:54,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:51:56,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:09,130 WARN L222 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:52:11,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:13,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:15,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:17,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:19,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:21,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:23,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:25,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:27,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:29,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:31,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:33,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:35,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:37,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:39,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:41,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:43,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:45,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:47,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:49,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:51,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:53,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:55,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:57,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:52:59,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:01,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:03,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:05,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:07,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:09,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:11,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:13,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:16,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:18,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:20,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:22,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:24,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:26,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:28,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:30,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:32,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:34,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:36,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:38,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:40,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:42,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:44,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:46,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:48,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:50,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:52,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:54,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:56,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:53:58,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:54:00,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:54:02,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:54:04,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:54:06,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:54:08,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:54:10,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:54:12,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:54:14,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:54:16,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:54:18,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:54:20,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:54:43,732 WARN L222 SmtUtils]: Spent 18.22s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:55:16,736 WARN L222 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:55:18,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:20,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:22,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:24,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:26,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:28,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:30,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:32,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:34,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:36,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:39,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:43,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:45,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:49,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:51,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:54,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:55:54,293 INFO L130 PetriNetUnfolder]: 11868/19729 cut-off events. [2023-01-27 20:55:54,293 INFO L131 PetriNetUnfolder]: For 1085759/1085759 co-relation queries the response was YES. [2023-01-27 20:55:54,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233769 conditions, 19729 events. 11868/19729 cut-off events. For 1085759/1085759 co-relation queries the response was YES. Maximal size of possible extension queue 1244. Compared 152817 event pairs, 1974 based on Foata normal form. 56/19771 useless extension candidates. Maximal degree in co-relation 232816. Up to 7762 conditions per place. [2023-01-27 20:55:54,536 INFO L137 encePairwiseOnDemand]: 169/183 looper letters, 787 selfloop transitions, 749 changer transitions 2/1538 dead transitions. [2023-01-27 20:55:54,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 1538 transitions, 41261 flow [2023-01-27 20:55:54,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-01-27 20:55:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-01-27 20:55:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2864 transitions. [2023-01-27 20:55:54,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742507037589005 [2023-01-27 20:55:54,553 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2864 transitions. [2023-01-27 20:55:54,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2864 transitions. [2023-01-27 20:55:54,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:55:54,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2864 transitions. [2023-01-27 20:55:54,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 86.78787878787878) internal successors, (2864), 33 states have internal predecessors, (2864), 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) [2023-01-27 20:55:54,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 183.0) internal successors, (6222), 34 states have internal predecessors, (6222), 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) [2023-01-27 20:55:54,559 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 183.0) internal successors, (6222), 34 states have internal predecessors, (6222), 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) [2023-01-27 20:55:54,559 INFO L175 Difference]: Start difference. First operand has 329 places, 814 transitions, 22264 flow. Second operand 33 states and 2864 transitions. [2023-01-27 20:55:54,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 1538 transitions, 41261 flow [2023-01-27 20:56:01,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 1538 transitions, 38870 flow, removed 779 selfloop flow, removed 5 redundant places. [2023-01-27 20:56:01,309 INFO L231 Difference]: Finished difference. Result has 376 places, 1127 transitions, 31489 flow [2023-01-27 20:56:01,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=20822, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=491, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=31489, PETRI_PLACES=376, PETRI_TRANSITIONS=1127} [2023-01-27 20:56:01,310 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 347 predicate places. [2023-01-27 20:56:01,310 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 1127 transitions, 31489 flow [2023-01-27 20:56:01,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 77.53333333333333) internal successors, (1163), 15 states have internal predecessors, (1163), 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) [2023-01-27 20:56:01,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:56:01,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:56:01,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-01-27 20:56:01,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:56:01,511 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 1 more)] === [2023-01-27 20:56:01,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:56:01,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1281665387, now seen corresponding path program 8 times [2023-01-27 20:56:01,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:56:01,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401206700] [2023-01-27 20:56:01,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:56:01,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:56:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:56:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:56:01,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:56:01,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401206700] [2023-01-27 20:56:01,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401206700] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:56:01,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:56:01,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 20:56:01,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665950965] [2023-01-27 20:56:01,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:56:01,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 20:56:01,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:56:01,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 20:56:01,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 20:56:01,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:56:01,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 1127 transitions, 31489 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:56:01,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:56:01,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:56:01,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:56:08,731 INFO L130 PetriNetUnfolder]: 11796/19654 cut-off events. [2023-01-27 20:56:08,731 INFO L131 PetriNetUnfolder]: For 1224407/1224407 co-relation queries the response was YES. [2023-01-27 20:56:08,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249115 conditions, 19654 events. 11796/19654 cut-off events. For 1224407/1224407 co-relation queries the response was YES. Maximal size of possible extension queue 1244. Compared 152540 event pairs, 4191 based on Foata normal form. 60/19700 useless extension candidates. Maximal degree in co-relation 248723. Up to 14381 conditions per place. [2023-01-27 20:56:08,994 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 1011 selfloop transitions, 178 changer transitions 15/1204 dead transitions. [2023-01-27 20:56:08,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1204 transitions, 35102 flow [2023-01-27 20:56:08,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 20:56:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 20:56:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 614 transitions. [2023-01-27 20:56:08,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47931303669008585 [2023-01-27 20:56:08,996 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 614 transitions. [2023-01-27 20:56:08,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 614 transitions. [2023-01-27 20:56:08,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:56:08,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 614 transitions. [2023-01-27 20:56:08,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.71428571428571) internal successors, (614), 7 states have internal predecessors, (614), 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) [2023-01-27 20:56:08,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:56:08,998 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:56:08,998 INFO L175 Difference]: Start difference. First operand has 376 places, 1127 transitions, 31489 flow. Second operand 7 states and 614 transitions. [2023-01-27 20:56:08,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 1204 transitions, 35102 flow [2023-01-27 20:56:16,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 1204 transitions, 33633 flow, removed 547 selfloop flow, removed 4 redundant places. [2023-01-27 20:56:16,723 INFO L231 Difference]: Finished difference. Result has 381 places, 1126 transitions, 30397 flow [2023-01-27 20:56:16,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=29949, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=30397, PETRI_PLACES=381, PETRI_TRANSITIONS=1126} [2023-01-27 20:56:16,724 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 352 predicate places. [2023-01-27 20:56:16,725 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 1126 transitions, 30397 flow [2023-01-27 20:56:16,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:56:16,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:56:16,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:56:16,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-01-27 20:56:16,725 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 1 more)] === [2023-01-27 20:56:16,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:56:16,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1853841217, now seen corresponding path program 9 times [2023-01-27 20:56:16,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:56:16,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021566533] [2023-01-27 20:56:16,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:56:16,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:56:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:56:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:56:16,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:56:16,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021566533] [2023-01-27 20:56:16,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021566533] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:56:16,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:56:16,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 20:56:16,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731158126] [2023-01-27 20:56:16,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:56:16,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 20:56:16,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:56:16,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 20:56:16,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-27 20:56:16,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:56:16,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 1126 transitions, 30397 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:56:16,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:56:16,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:56:16,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:56:24,176 INFO L130 PetriNetUnfolder]: 11702/19465 cut-off events. [2023-01-27 20:56:24,176 INFO L131 PetriNetUnfolder]: For 1158292/1158292 co-relation queries the response was YES. [2023-01-27 20:56:24,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239633 conditions, 19465 events. 11702/19465 cut-off events. For 1158292/1158292 co-relation queries the response was YES. Maximal size of possible extension queue 1230. Compared 150437 event pairs, 4163 based on Foata normal form. 24/19475 useless extension candidates. Maximal degree in co-relation 239466. Up to 14381 conditions per place. [2023-01-27 20:56:24,452 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 989 selfloop transitions, 179 changer transitions 21/1189 dead transitions. [2023-01-27 20:56:24,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 1189 transitions, 33709 flow [2023-01-27 20:56:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 20:56:24,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 20:56:24,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 609 transitions. [2023-01-27 20:56:24,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47540983606557374 [2023-01-27 20:56:24,454 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 609 transitions. [2023-01-27 20:56:24,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 609 transitions. [2023-01-27 20:56:24,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:56:24,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 609 transitions. [2023-01-27 20:56:24,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 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) [2023-01-27 20:56:24,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:56:24,455 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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) [2023-01-27 20:56:24,455 INFO L175 Difference]: Start difference. First operand has 381 places, 1126 transitions, 30397 flow. Second operand 7 states and 609 transitions. [2023-01-27 20:56:24,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 1189 transitions, 33709 flow [2023-01-27 20:56:30,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 1189 transitions, 33341 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-01-27 20:56:30,538 INFO L231 Difference]: Finished difference. Result has 384 places, 1120 transitions, 30194 flow [2023-01-27 20:56:30,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=29873, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=30194, PETRI_PLACES=384, PETRI_TRANSITIONS=1120} [2023-01-27 20:56:30,539 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 355 predicate places. [2023-01-27 20:56:30,539 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 1120 transitions, 30194 flow [2023-01-27 20:56:30,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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) [2023-01-27 20:56:30,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:56:30,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:56:30,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-01-27 20:56:30,539 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 20:56:30,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:56:30,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2133347175, now seen corresponding path program 13 times [2023-01-27 20:56:30,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:56:30,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47704797] [2023-01-27 20:56:30,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:56:30,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:56:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:56:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:56:30,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:56:30,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47704797] [2023-01-27 20:56:30,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47704797] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:56:30,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60384212] [2023-01-27 20:56:30,635 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 20:56:30,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:56:30,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:56:30,636 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 20:56:30,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-01-27 20:56:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:56:30,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2023-01-27 20:56:30,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:56:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:56:30,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:56:33,002 WARN L839 $PredicateComparison]: unable to prove that (forall ((aux_mod_~a~0_21 Int)) (or (>= aux_mod_~a~0_21 4294967296) (<= aux_mod_~a~0_21 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (let ((.cse0 (* 4294967295 aux_mod_~a~0_21))) (< (+ (* 4294967296 (div .cse0 4294967296)) (mod c_thread2Thread1of1ForFork2_~i~1 4294967296)) .cse0)))) is different from false [2023-01-27 20:56:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-27 20:56:33,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60384212] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:56:33,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:56:33,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 11 [2023-01-27 20:56:33,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409642781] [2023-01-27 20:56:33,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:56:33,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 20:56:33,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:56:33,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 20:56:33,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=67, Unknown=1, NotChecked=16, Total=110 [2023-01-27 20:56:33,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:56:33,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 1120 transitions, 30194 flow. Second operand has 11 states, 11 states have (on average 77.63636363636364) internal successors, (854), 11 states have internal predecessors, (854), 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) [2023-01-27 20:56:33,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:56:33,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:56:33,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:56:41,519 INFO L130 PetriNetUnfolder]: 13075/21618 cut-off events. [2023-01-27 20:56:41,520 INFO L131 PetriNetUnfolder]: For 1304394/1304394 co-relation queries the response was YES. [2023-01-27 20:56:41,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270697 conditions, 21618 events. 13075/21618 cut-off events. For 1304394/1304394 co-relation queries the response was YES. Maximal size of possible extension queue 1349. Compared 168108 event pairs, 3693 based on Foata normal form. 24/21628 useless extension candidates. Maximal degree in co-relation 270529. Up to 11679 conditions per place. [2023-01-27 20:56:41,925 INFO L137 encePairwiseOnDemand]: 169/183 looper letters, 1046 selfloop transitions, 417 changer transitions 1/1464 dead transitions. [2023-01-27 20:56:41,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 1464 transitions, 41974 flow [2023-01-27 20:56:41,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-27 20:56:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-27 20:56:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 966 transitions. [2023-01-27 20:56:41,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4798807749627422 [2023-01-27 20:56:41,927 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 966 transitions. [2023-01-27 20:56:41,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 966 transitions. [2023-01-27 20:56:41,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:56:41,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 966 transitions. [2023-01-27 20:56:41,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 87.81818181818181) internal successors, (966), 11 states have internal predecessors, (966), 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) [2023-01-27 20:56:41,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 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) [2023-01-27 20:56:41,930 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 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) [2023-01-27 20:56:41,930 INFO L175 Difference]: Start difference. First operand has 384 places, 1120 transitions, 30194 flow. Second operand 11 states and 966 transitions. [2023-01-27 20:56:41,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 1464 transitions, 41974 flow [2023-01-27 20:56:49,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 1464 transitions, 41584 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-01-27 20:56:49,940 INFO L231 Difference]: Finished difference. Result has 395 places, 1274 transitions, 36464 flow [2023-01-27 20:56:49,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=29812, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=264, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=36464, PETRI_PLACES=395, PETRI_TRANSITIONS=1274} [2023-01-27 20:56:49,941 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 366 predicate places. [2023-01-27 20:56:49,941 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 1274 transitions, 36464 flow [2023-01-27 20:56:49,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 77.63636363636364) internal successors, (854), 11 states have internal predecessors, (854), 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) [2023-01-27 20:56:49,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:56:49,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:56:49,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-01-27 20:56:50,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-01-27 20:56:50,142 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 20:56:50,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:56:50,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1617992939, now seen corresponding path program 10 times [2023-01-27 20:56:50,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:56:50,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050576472] [2023-01-27 20:56:50,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:56:50,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:56:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:56:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:56:50,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:56:50,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050576472] [2023-01-27 20:56:50,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050576472] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:56:50,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962481606] [2023-01-27 20:56:50,237 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 20:56:50,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:56:50,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:56:50,238 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 20:56:50,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-01-27 20:56:50,332 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 20:56:50,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:56:50,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-27 20:56:50,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:56:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:56:50,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:56:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:56:50,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962481606] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:56:50,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:56:50,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2023-01-27 20:56:50,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33678282] [2023-01-27 20:56:50,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:56:50,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-27 20:56:50,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:56:50,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-27 20:56:50,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-01-27 20:56:50,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:56:50,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 1274 transitions, 36464 flow. Second operand has 15 states, 15 states have (on average 77.2) internal successors, (1158), 15 states have internal predecessors, (1158), 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) [2023-01-27 20:56:50,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:56:50,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:56:50,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:56:59,644 INFO L130 PetriNetUnfolder]: 13117/21666 cut-off events. [2023-01-27 20:56:59,644 INFO L131 PetriNetUnfolder]: For 1402906/1402906 co-relation queries the response was YES. [2023-01-27 20:56:59,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282921 conditions, 21666 events. 13117/21666 cut-off events. For 1402906/1402906 co-relation queries the response was YES. Maximal size of possible extension queue 1351. Compared 168490 event pairs, 4445 based on Foata normal form. 44/21696 useless extension candidates. Maximal degree in co-relation 282746. Up to 16609 conditions per place. [2023-01-27 20:56:59,957 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 1173 selfloop transitions, 200 changer transitions 2/1375 dead transitions. [2023-01-27 20:56:59,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 1375 transitions, 40895 flow [2023-01-27 20:56:59,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-27 20:56:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-27 20:56:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1024 transitions. [2023-01-27 20:56:59,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4663023679417122 [2023-01-27 20:56:59,958 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1024 transitions. [2023-01-27 20:56:59,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1024 transitions. [2023-01-27 20:56:59,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:56:59,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1024 transitions. [2023-01-27 20:56:59,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 85.33333333333333) internal successors, (1024), 12 states have internal predecessors, (1024), 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) [2023-01-27 20:56:59,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 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) [2023-01-27 20:56:59,961 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 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) [2023-01-27 20:56:59,961 INFO L175 Difference]: Start difference. First operand has 395 places, 1274 transitions, 36464 flow. Second operand 12 states and 1024 transitions. [2023-01-27 20:56:59,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 1375 transitions, 40895 flow [2023-01-27 20:57:09,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 1375 transitions, 40246 flow, removed 210 selfloop flow, removed 3 redundant places. [2023-01-27 20:57:09,269 INFO L231 Difference]: Finished difference. Result has 410 places, 1288 transitions, 36679 flow [2023-01-27 20:57:09,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=35819, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1080, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=36679, PETRI_PLACES=410, PETRI_TRANSITIONS=1288} [2023-01-27 20:57:09,270 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 381 predicate places. [2023-01-27 20:57:09,271 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 1288 transitions, 36679 flow [2023-01-27 20:57:09,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 77.2) internal successors, (1158), 15 states have internal predecessors, (1158), 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) [2023-01-27 20:57:09,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:57:09,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:57:09,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-01-27 20:57:09,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-01-27 20:57:09,475 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 20:57:09,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:57:09,475 INFO L85 PathProgramCache]: Analyzing trace with hash -194389803, now seen corresponding path program 14 times [2023-01-27 20:57:09,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:57:09,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960893680] [2023-01-27 20:57:09,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:57:09,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:57:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:57:09,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:57:09,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:57:09,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960893680] [2023-01-27 20:57:09,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960893680] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 20:57:09,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358331600] [2023-01-27 20:57:09,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 20:57:09,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:57:09,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:57:09,573 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 20:57:09,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-01-27 20:57:09,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 20:57:09,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:57:09,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-27 20:57:09,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:57:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:57:09,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:57:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:57:14,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358331600] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:57:14,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 20:57:14,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 16 [2023-01-27 20:57:14,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756285724] [2023-01-27 20:57:14,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 20:57:14,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-01-27 20:57:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:57:14,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-01-27 20:57:14,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=178, Unknown=2, NotChecked=0, Total=240 [2023-01-27 20:57:14,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-27 20:57:14,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 1288 transitions, 36679 flow. Second operand has 16 states, 16 states have (on average 77.25) internal successors, (1236), 16 states have internal predecessors, (1236), 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) [2023-01-27 20:57:14,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:57:14,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-27 20:57:14,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:57:16,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:18,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:20,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:22,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:24,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:26,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:28,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:30,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:33,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:35,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:37,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:39,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:41,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:43,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:45,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:47,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:49,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:51,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:53,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:55,818 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296)) (.cse0 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296))) (and (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse1 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 .cse0) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse1) (< .cse1 0) (let ((.cse3 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ .cse2 (* (div .cse3 4294967296) 4294967296)) .cse3)) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (or (let ((.cse4 (* 4294967295 c_~a~0))) (< (+ .cse2 (* (div .cse4 4294967296) 4294967296)) .cse4)) (< .cse0 (mod c_~a~0 4294967296))))) is different from false [2023-01-27 20:57:57,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:57:59,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:58:01,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:58:20,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:58:22,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:58:24,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:58:27,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:58:30,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:58:32,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:58:34,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:58:36,436 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296))) (and (forall ((aux_div_aux_mod_~a~0_21_32 Int) (aux_mod_aux_mod_~a~0_21_32 Int)) (let ((.cse0 (+ aux_mod_aux_mod_~a~0_21_32 (* aux_div_aux_mod_~a~0_21_32 4294967296)))) (or (<= aux_mod_aux_mod_~a~0_21_32 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse0) (< .cse0 0) (let ((.cse2 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ .cse1 (* (div .cse2 4294967296) 4294967296)) .cse2)) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (let ((.cse3 (* 4294967295 c_~a~0))) (< (+ (* (div (+ .cse3 (mod c_thread3Thread1of1ForFork0_~i~2 4294967296)) 4294967296) 4294967296) .cse1) .cse3)))) is different from false [2023-01-27 20:58:39,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:58:41,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:58:44,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:58:47,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-01-27 20:58:51,097 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 20:58:51,097 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 20:58:51,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-27 20:58:51,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-01-27 20:58:51,969 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-27 20:58:51,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-01-27 20:58:52,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-01-27 20:58:52,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-01-27 20:58:52,173 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 75/183 universal loopers) in iteration 29,while PetriNetUnfolder was constructing finite prefix that currently has 206682 conditions, 14889 events (10043/14888 cut-off events. For 1083672/1083672 co-relation queries the response was YES. Maximal size of possible extension queue 1455. Compared 104270 event pairs, 1940 based on Foata normal form. 25/16118 useless extension candidates. Maximal degree in co-relation 206500. Up to 5996 conditions per place.). [2023-01-27 20:58:52,174 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-01-27 20:58:52,174 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-01-27 20:58:52,174 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-01-27 20:58:52,174 INFO L445 BasicCegarLoop]: Path program histogram: [14, 10, 4, 1] [2023-01-27 20:58:52,176 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 20:58:52,177 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 20:58:52,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 08:58:52 BasicIcfg [2023-01-27 20:58:52,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 20:58:52,178 INFO L158 Benchmark]: Toolchain (without parser) took 861401.49ms. Allocated memory was 555.7MB in the beginning and 9.2GB in the end (delta: 8.6GB). Free memory was 516.3MB in the beginning and 6.9GB in the end (delta: -6.4GB). Peak memory consumption was 3.0GB. Max. memory is 16.0GB. [2023-01-27 20:58:52,178 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 375.4MB. Free memory is still 322.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 20:58:52,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.73ms. Allocated memory is still 555.7MB. Free memory was 516.3MB in the beginning and 505.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-27 20:58:52,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.73ms. Allocated memory is still 555.7MB. Free memory was 505.6MB in the beginning and 503.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 20:58:52,178 INFO L158 Benchmark]: Boogie Preprocessor took 14.32ms. Allocated memory is still 555.7MB. Free memory was 503.9MB in the beginning and 502.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 20:58:52,179 INFO L158 Benchmark]: RCFGBuilder took 361.06ms. Allocated memory is still 555.7MB. Free memory was 502.7MB in the beginning and 487.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-01-27 20:58:52,179 INFO L158 Benchmark]: TraceAbstraction took 860852.09ms. Allocated memory was 555.7MB in the beginning and 9.2GB in the end (delta: 8.6GB). Free memory was 485.9MB in the beginning and 6.9GB in the end (delta: -6.5GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2023-01-27 20:58:52,179 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 375.4MB. Free memory is still 322.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 150.73ms. Allocated memory is still 555.7MB. Free memory was 516.3MB in the beginning and 505.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 19.73ms. Allocated memory is still 555.7MB. Free memory was 505.6MB in the beginning and 503.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 14.32ms. Allocated memory is still 555.7MB. Free memory was 503.9MB in the beginning and 502.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 361.06ms. Allocated memory is still 555.7MB. Free memory was 502.7MB in the beginning and 487.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 860852.09ms. Allocated memory was 555.7MB in the beginning and 9.2GB in the end (delta: 8.6GB). Free memory was 485.9MB in the beginning and 6.9GB in the end (delta: -6.5GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 95 PlacesBefore, 29 PlacesAfterwards, 92 TransitionsBefore, 22 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 6 ConcurrentYvCompositions, 4 ChoiceCompositions, 78 TotalNumberOfCompositions, 1314 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1314, independent: 1314, independent conditional: 0, independent unconditional: 1314, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 708, independent: 708, independent conditional: 0, independent unconditional: 708, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1314, independent: 606, independent conditional: 0, independent unconditional: 606, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 708, unknown conditional: 0, unknown unconditional: 708] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 75/183 universal loopers) in iteration 29,while PetriNetUnfolder was constructing finite prefix that currently has 206682 conditions, 14889 events (10043/14888 cut-off events. For 1083672/1083672 co-relation queries the response was YES. Maximal size of possible extension queue 1455. Compared 104270 event pairs, 1940 based on Foata normal form. 25/16118 useless extension candidates. Maximal degree in co-relation 206500. Up to 5996 conditions per place.). - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 75/183 universal loopers) in iteration 29,while PetriNetUnfolder was constructing finite prefix that currently has 206682 conditions, 14889 events (10043/14888 cut-off events. For 1083672/1083672 co-relation queries the response was YES. Maximal size of possible extension queue 1455. Compared 104270 event pairs, 1940 based on Foata normal form. 25/16118 useless extension candidates. Maximal degree in co-relation 206500. Up to 5996 conditions per place.). - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 75/183 universal loopers) in iteration 29,while PetriNetUnfolder was constructing finite prefix that currently has 206682 conditions, 14889 events (10043/14888 cut-off events. For 1083672/1083672 co-relation queries the response was YES. Maximal size of possible extension queue 1455. Compared 104270 event pairs, 1940 based on Foata normal form. 25/16118 useless extension candidates. Maximal degree in co-relation 206500. Up to 5996 conditions per place.). - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 75/183 universal loopers) in iteration 29,while PetriNetUnfolder was constructing finite prefix that currently has 206682 conditions, 14889 events (10043/14888 cut-off events. For 1083672/1083672 co-relation queries the response was YES. Maximal size of possible extension queue 1455. Compared 104270 event pairs, 1940 based on Foata normal form. 25/16118 useless extension candidates. Maximal degree in co-relation 206500. Up to 5996 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 129 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 860.7s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 830.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 245 mSolverCounterUnknown, 2439 SdHoareTripleChecker+Valid, 562.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2439 mSDsluCounter, 897 SdHoareTripleChecker+Invalid, 557.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1112 IncrementalHoareTripleChecker+Unchecked, 634 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11107 IncrementalHoareTripleChecker+Invalid, 12551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 263 mSDtfsCounter, 11107 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1098 GetRequests, 649 SyntacticMatches, 32 SemanticMatches, 417 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1550 ImplicationChecksByTransitivity, 159.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36679occurred in iteration=28, InterpolantAutomatonStates: 298, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 939 NumberOfCodeBlocks, 939 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1234 ConstructedInterpolants, 10 QuantifiedInterpolants, 7432 SizeOfPredicates, 132 NumberOfNonLiveVariables, 2862 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 65 InterpolantComputations, 17 PerfectInterpolantSequences, 16/64 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown