/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 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -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-28 09:29:16,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 09:29:16,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 09:29:16,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 09:29:16,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 09:29:16,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 09:29:16,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 09:29:16,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 09:29:16,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 09:29:16,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 09:29:16,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 09:29:16,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 09:29:16,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 09:29:16,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 09:29:16,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 09:29:16,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 09:29:16,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 09:29:16,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 09:29:16,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 09:29:16,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 09:29:16,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 09:29:16,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 09:29:16,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 09:29:16,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 09:29:16,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 09:29:16,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 09:29:16,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 09:29:16,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 09:29:16,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 09:29:16,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 09:29:16,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 09:29:16,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 09:29:16,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 09:29:16,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 09:29:16,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 09:29:16,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 09:29:16,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 09:29:16,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 09:29:16,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 09:29:16,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 09:29:16,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 09:29:16,939 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-28 09:29:16,960 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 09:29:16,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 09:29:16,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 09:29:16,961 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 09:29:16,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 09:29:16,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 09:29:16,962 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 09:29:16,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 09:29:16,962 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 09:29:16,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 09:29:16,963 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 09:29:16,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 09:29:16,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 09:29:16,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 09:29:16,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 09:29:16,964 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 09:29:16,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 09:29:16,964 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 09:29:16,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 09:29:16,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 09:29:16,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 09:29:16,964 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 09:29:16,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 09:29:16,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 09:29:16,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 09:29:16,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 09:29:16,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 09:29:16,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 09:29:16,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 09:29:16,965 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 09:29:16,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 09:29:16,965 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 09:29:17,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 09:29:17,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 09:29:17,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 09:29:17,179 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 09:29:17,180 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 09:29:17,180 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-28 09:29:18,174 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 09:29:18,359 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 09:29:18,360 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2023-01-28 09:29:18,364 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f2075bfa/16d8547674e64fc8b14c7a87f7204d58/FLAGf99742b2b [2023-01-28 09:29:18,374 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f2075bfa/16d8547674e64fc8b14c7a87f7204d58 [2023-01-28 09:29:18,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 09:29:18,376 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 09:29:18,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 09:29:18,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 09:29:18,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 09:29:18,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:29:18" (1/1) ... [2023-01-28 09:29:18,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a29cf71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:29:18, skipping insertion in model container [2023-01-28 09:29:18,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:29:18" (1/1) ... [2023-01-28 09:29:18,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 09:29:18,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 09:29:18,518 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-28 09:29:18,525 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 09:29:18,532 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 09:29:18,555 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-28 09:29:18,560 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 09:29:18,570 INFO L208 MainTranslator]: Completed translation [2023-01-28 09:29:18,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:29:18 WrapperNode [2023-01-28 09:29:18,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 09:29:18,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 09:29:18,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 09:29:18,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 09:29:18,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:29:18" (1/1) ... [2023-01-28 09:29:18,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:29:18" (1/1) ... [2023-01-28 09:29:18,604 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2023-01-28 09:29:18,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 09:29:18,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 09:29:18,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 09:29:18,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 09:29:18,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:29:18" (1/1) ... [2023-01-28 09:29:18,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:29:18" (1/1) ... [2023-01-28 09:29:18,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:29:18" (1/1) ... [2023-01-28 09:29:18,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:29:18" (1/1) ... [2023-01-28 09:29:18,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:29:18" (1/1) ... [2023-01-28 09:29:18,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:29:18" (1/1) ... [2023-01-28 09:29:18,631 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:29:18" (1/1) ... [2023-01-28 09:29:18,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:29:18" (1/1) ... [2023-01-28 09:29:18,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 09:29:18,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 09:29:18,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 09:29:18,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 09:29:18,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:29:18" (1/1) ... [2023-01-28 09:29:18,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 09:29:18,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:29:18,674 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-28 09:29:18,692 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-28 09:29:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 09:29:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 09:29:18,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 09:29:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 09:29:18,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 09:29:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 09:29:18,716 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 09:29:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 09:29:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 09:29:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 09:29:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 09:29:18,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 09:29:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 09:29:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 09:29:18,717 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 09:29:18,775 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 09:29:18,776 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 09:29:18,911 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 09:29:18,915 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 09:29:18,915 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-28 09:29:18,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:29:18 BoogieIcfgContainer [2023-01-28 09:29:18,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 09:29:18,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 09:29:18,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 09:29:18,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 09:29:18,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:29:18" (1/3) ... [2023-01-28 09:29:18,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b57fd12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:29:18, skipping insertion in model container [2023-01-28 09:29:18,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:29:18" (2/3) ... [2023-01-28 09:29:18,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b57fd12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:29:18, skipping insertion in model container [2023-01-28 09:29:18,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:29:18" (3/3) ... [2023-01-28 09:29:18,922 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2023-01-28 09:29:18,932 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 09:29:18,933 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 09:29:18,933 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 09:29:18,993 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-28 09:29:19,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 105 transitions, 234 flow [2023-01-28 09:29:19,091 INFO L130 PetriNetUnfolder]: 7/102 cut-off events. [2023-01-28 09:29:19,091 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 09:29:19,095 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-28 09:29:19,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 105 transitions, 234 flow [2023-01-28 09:29:19,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 92 transitions, 202 flow [2023-01-28 09:29:19,100 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 09:29:19,105 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 92 transitions, 202 flow [2023-01-28 09:29:19,107 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 92 transitions, 202 flow [2023-01-28 09:29:19,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 92 transitions, 202 flow [2023-01-28 09:29:19,139 INFO L130 PetriNetUnfolder]: 7/92 cut-off events. [2023-01-28 09:29:19,139 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 09:29:19,140 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-28 09:29:19,141 INFO L119 LiptonReduction]: Number of co-enabled transitions 1320 [2023-01-28 09:29:21,155 INFO L134 LiptonReduction]: Checked pairs total: 1314 [2023-01-28 09:29:21,155 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-01-28 09:29:21,165 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 09:29:21,169 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;@3ae527b7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 09:29:21,169 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 09:29:21,174 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2023-01-28 09:29:21,174 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 09:29:21,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:29:21,174 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-28 09:29:21,175 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-28 09:29:21,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:29:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1681500982, now seen corresponding path program 1 times [2023-01-28 09:29:21,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:29:21,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355518890] [2023-01-28 09:29:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:29:21,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:29:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:29:21,575 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-28 09:29:21,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:29:21,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355518890] [2023-01-28 09:29:21,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355518890] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:29:21,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:29:21,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 09:29:21,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987655072] [2023-01-28 09:29:21,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:29:21,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 09:29:21,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:29:21,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 09:29:21,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 09:29:21,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 183 [2023-01-28 09:29:21,606 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-28 09:29:21,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:29:21,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 183 [2023-01-28 09:29:21,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:29:21,717 INFO L130 PetriNetUnfolder]: 359/506 cut-off events. [2023-01-28 09:29:21,717 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2023-01-28 09:29:21,721 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-28 09:29:21,726 INFO L137 encePairwiseOnDemand]: 178/183 looper letters, 30 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2023-01-28 09:29:21,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 179 flow [2023-01-28 09:29:21,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 09:29:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 09:29:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-01-28 09:29:21,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5409836065573771 [2023-01-28 09:29:21,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-01-28 09:29:21,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-01-28 09:29:21,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:29:21,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-01-28 09:29:21,749 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-28 09:29:21,752 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-28 09:29:21,752 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-28 09:29:21,753 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 62 flow. Second operand 3 states and 297 transitions. [2023-01-28 09:29:21,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 179 flow [2023-01-28 09:29:21,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 38 transitions, 157 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-01-28 09:29:21,757 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 76 flow [2023-01-28 09:29:21,758 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-28 09:29:21,761 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places. [2023-01-28 09:29:21,761 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 76 flow [2023-01-28 09:29:21,761 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-28 09:29:21,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:29:21,761 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-28 09:29:21,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 09:29:21,762 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-28 09:29:21,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:29:21,762 INFO L85 PathProgramCache]: Analyzing trace with hash -296399337, now seen corresponding path program 1 times [2023-01-28 09:29:21,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:29:21,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334309542] [2023-01-28 09:29:21,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:29:21,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:29:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:29:21,940 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-28 09:29:21,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:29:21,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334309542] [2023-01-28 09:29:21,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334309542] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:29:21,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:29:21,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 09:29:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538410548] [2023-01-28 09:29:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:29:21,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 09:29:21,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:29:21,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 09:29:21,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 09:29:21,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-28 09:29:21,944 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-28 09:29:21,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:29:21,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-28 09:29:21,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:29:22,272 INFO L130 PetriNetUnfolder]: 596/906 cut-off events. [2023-01-28 09:29:22,272 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2023-01-28 09:29:22,275 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-28 09:29:22,278 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 69 selfloop transitions, 8 changer transitions 8/85 dead transitions. [2023-01-28 09:29:22,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 85 transitions, 416 flow [2023-01-28 09:29:22,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 09:29:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 09:29:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 603 transitions. [2023-01-28 09:29:22,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707259953161593 [2023-01-28 09:29:22,280 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 603 transitions. [2023-01-28 09:29:22,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 603 transitions. [2023-01-28 09:29:22,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:29:22,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 603 transitions. [2023-01-28 09:29:22,282 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-28 09:29:22,285 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-28 09:29:22,285 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-28 09:29:22,285 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 76 flow. Second operand 7 states and 603 transitions. [2023-01-28 09:29:22,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 85 transitions, 416 flow [2023-01-28 09:29:22,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 85 transitions, 406 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 09:29:22,289 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 139 flow [2023-01-28 09:29:22,289 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-28 09:29:22,289 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2023-01-28 09:29:22,290 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 139 flow [2023-01-28 09:29:22,290 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-28 09:29:22,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:29:22,290 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-28 09:29:22,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 09:29:22,291 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-28 09:29:22,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:29:22,293 INFO L85 PathProgramCache]: Analyzing trace with hash -748397025, now seen corresponding path program 2 times [2023-01-28 09:29:22,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:29:22,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081492710] [2023-01-28 09:29:22,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:29:22,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:29:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:29:22,512 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-28 09:29:22,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:29:22,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081492710] [2023-01-28 09:29:22,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081492710] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:29:22,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344696343] [2023-01-28 09:29:22,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 09:29:22,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:29:22,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:29:22,515 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-28 09:29:22,520 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-28 09:29:22,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 09:29:22,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:29:22,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-28 09:29:22,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:29:22,804 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-28 09:29:22,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:29:22,922 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-28 09:29:22,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344696343] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 09:29:22,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 09:29:22,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 14 [2023-01-28 09:29:22,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264340557] [2023-01-28 09:29:22,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:29:22,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 09:29:22,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:29:22,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 09:29:22,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-01-28 09:29:22,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 183 [2023-01-28 09:29:22,929 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-28 09:29:22,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:29:22,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 183 [2023-01-28 09:29:22,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:29:23,233 INFO L130 PetriNetUnfolder]: 832/1268 cut-off events. [2023-01-28 09:29:23,233 INFO L131 PetriNetUnfolder]: For 1476/1531 co-relation queries the response was YES. [2023-01-28 09:29:23,235 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-28 09:29:23,240 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 99 selfloop transitions, 17 changer transitions 1/118 dead transitions. [2023-01-28 09:29:23,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 118 transitions, 705 flow [2023-01-28 09:29:23,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 09:29:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 09:29:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 729 transitions. [2023-01-28 09:29:23,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979508196721312 [2023-01-28 09:29:23,242 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 729 transitions. [2023-01-28 09:29:23,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 729 transitions. [2023-01-28 09:29:23,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:29:23,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 729 transitions. [2023-01-28 09:29:23,244 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-28 09:29:23,246 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-28 09:29:23,246 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-28 09:29:23,246 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 139 flow. Second operand 8 states and 729 transitions. [2023-01-28 09:29:23,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 118 transitions, 705 flow [2023-01-28 09:29:23,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 118 transitions, 675 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-01-28 09:29:23,252 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 294 flow [2023-01-28 09:29:23,253 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-28 09:29:23,254 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2023-01-28 09:29:23,254 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 294 flow [2023-01-28 09:29:23,254 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-28 09:29:23,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:29:23,254 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-28 09:29:23,271 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-28 09:29:23,459 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-28 09:29:23,460 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-28 09:29:23,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:29:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1550280123, now seen corresponding path program 3 times [2023-01-28 09:29:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:29:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175492793] [2023-01-28 09:29:23,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:29:23,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:29:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:29:23,639 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-28 09:29:23,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:29:23,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175492793] [2023-01-28 09:29:23,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175492793] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:29:23,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:29:23,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 09:29:23,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152115264] [2023-01-28 09:29:23,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:29:23,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 09:29:23,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:29:23,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 09:29:23,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-01-28 09:29:23,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-28 09:29:23,644 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-28 09:29:23,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:29:23,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-28 09:29:23,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:29:23,933 INFO L130 PetriNetUnfolder]: 1203/1834 cut-off events. [2023-01-28 09:29:23,937 INFO L131 PetriNetUnfolder]: For 5174/5174 co-relation queries the response was YES. [2023-01-28 09:29:23,941 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-28 09:29:23,949 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 108 selfloop transitions, 29 changer transitions 18/155 dead transitions. [2023-01-28 09:29:23,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 155 transitions, 1178 flow [2023-01-28 09:29:23,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 09:29:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 09:29:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 860 transitions. [2023-01-28 09:29:23,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46994535519125685 [2023-01-28 09:29:23,952 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 860 transitions. [2023-01-28 09:29:23,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 860 transitions. [2023-01-28 09:29:23,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:29:23,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 860 transitions. [2023-01-28 09:29:23,955 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-28 09:29:23,957 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-28 09:29:23,958 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-28 09:29:23,958 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 294 flow. Second operand 10 states and 860 transitions. [2023-01-28 09:29:23,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 155 transitions, 1178 flow [2023-01-28 09:29:23,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 155 transitions, 1174 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-01-28 09:29:23,971 INFO L231 Difference]: Finished difference. Result has 62 places, 73 transitions, 620 flow [2023-01-28 09:29:23,972 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-28 09:29:23,973 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 33 predicate places. [2023-01-28 09:29:23,973 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 73 transitions, 620 flow [2023-01-28 09:29:23,973 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-28 09:29:23,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:29:23,973 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-28 09:29:23,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 09:29:23,974 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-28 09:29:23,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:29:23,974 INFO L85 PathProgramCache]: Analyzing trace with hash 382118611, now seen corresponding path program 4 times [2023-01-28 09:29:23,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:29:23,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893753252] [2023-01-28 09:29:23,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:29:23,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:29:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:29:24,135 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-28 09:29:24,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:29:24,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893753252] [2023-01-28 09:29:24,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893753252] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:29:24,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425467414] [2023-01-28 09:29:24,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 09:29:24,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:29:24,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:29:24,137 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-28 09:29:24,208 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-28 09:29:24,266 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 09:29:24,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:29:24,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 09:29:24,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:29:24,370 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-28 09:29:24,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:29:28,956 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-28 09:29:28,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425467414] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:29:28,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:29:28,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2023-01-28 09:29:28,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997684805] [2023-01-28 09:29:28,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:29:28,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-01-28 09:29:28,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:29:28,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-01-28 09:29:28,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=171, Unknown=1, NotChecked=0, Total=240 [2023-01-28 09:29:28,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-28 09:29:28,960 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-28 09:29:28,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:29:28,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-28 09:29:28,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:29:37,325 WARN L222 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 09:29:39,449 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-28 09:29:41,482 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-28 09:29:42,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:29:44,573 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-28 09:29:46,628 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-28 09:29:48,680 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-28 09:29:50,740 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-28 09:29:52,815 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-28 09:30:07,506 WARN L222 SmtUtils]: Spent 6.31s 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-28 09:30:42,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:30:49,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:31:08,272 WARN L222 SmtUtils]: Spent 12.12s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 09:31:12,743 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-28 09:31:14,865 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-28 09:31:16,911 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-28 09:31:18,993 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-28 09:31:21,061 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-28 09:31:23,115 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-28 09:31:25,168 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-28 09:31:27,217 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-28 09:31:29,224 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-28 09:31:31,262 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)))) (< .cse2 (mod (+ c_~b~0 c_~a~0) 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-28 09:31:33,269 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-28 09:31:35,296 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-28 09:31:37,369 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-28 09:31:39,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:31:41,535 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-28 09:31:43,550 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-28 09:31:45,581 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-28 09:31:47,595 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-28 09:31:49,604 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-28 09:31:51,725 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-28 09:31:53,757 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-28 09:31:55,790 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-28 09:31:57,800 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-28 09:31:59,819 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-28 09:32:01,824 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-28 09:32:03,839 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-28 09:32:05,859 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-28 09:32:07,892 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-28 09:32:09,931 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-28 09:32:11,947 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-28 09:32:13,976 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-28 09:32:15,998 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-28 09:32:18,094 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-28 09:32:20,148 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-28 09:32:22,390 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-28 09:32:24,444 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-28 09:32:26,665 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-28 09:32:28,682 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-28 09:32:30,704 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-28 09:32:32,772 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-28 09:32:34,787 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-28 09:32:36,851 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-28 09:32:38,969 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-28 09:32:41,001 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-28 09:32:43,040 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-28 09:32:45,079 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-28 09:32:47,136 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-28 09:32:49,157 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-28 09:32:51,179 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-28 09:32:53,207 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-28 09:32:55,224 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-28 09:32:57,241 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-28 09:32:59,250 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-28 09:33:01,320 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-28 09:33:03,335 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-28 09:33:05,349 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-28 09:33:07,366 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-28 09:33:09,390 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-28 09:33:11,491 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-28 09:33:13,514 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-28 09:33:15,577 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-28 09:33:17,613 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-28 09:33:19,642 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-28 09:33:19,776 INFO L130 PetriNetUnfolder]: 2526/3920 cut-off events. [2023-01-28 09:33:19,777 INFO L131 PetriNetUnfolder]: For 18120/18120 co-relation queries the response was YES. [2023-01-28 09:33:19,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17531 conditions, 3920 events. 2526/3920 cut-off events. For 18120/18120 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 20598 event pairs, 380 based on Foata normal form. 46/3966 useless extension candidates. Maximal degree in co-relation 15600. Up to 1361 conditions per place. [2023-01-28 09:33:19,823 INFO L137 encePairwiseOnDemand]: 170/183 looper letters, 227 selfloop transitions, 122 changer transitions 3/352 dead transitions. [2023-01-28 09:33:19,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 352 transitions, 2915 flow [2023-01-28 09:33:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-28 09:33:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-01-28 09:33:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2223 transitions. [2023-01-28 09:33:19,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672131147540984 [2023-01-28 09:33:19,841 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2223 transitions. [2023-01-28 09:33:19,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2223 transitions. [2023-01-28 09:33:19,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:33:19,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2223 transitions. [2023-01-28 09:33:19,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 85.5) internal successors, (2223), 26 states have internal predecessors, (2223), 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-28 09:33:19,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 183.0) internal successors, (4941), 27 states have internal predecessors, (4941), 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-28 09:33:19,851 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 183.0) internal successors, (4941), 27 states have internal predecessors, (4941), 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-28 09:33:19,851 INFO L175 Difference]: Start difference. First operand has 62 places, 73 transitions, 620 flow. Second operand 26 states and 2223 transitions. [2023-01-28 09:33:19,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 352 transitions, 2915 flow [2023-01-28 09:33:19,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 352 transitions, 2857 flow, removed 29 selfloop flow, removed 1 redundant places. [2023-01-28 09:33:19,908 INFO L231 Difference]: Finished difference. Result has 107 places, 170 transitions, 1942 flow [2023-01-28 09:33:19,908 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1942, PETRI_PLACES=107, PETRI_TRANSITIONS=170} [2023-01-28 09:33:19,909 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 78 predicate places. [2023-01-28 09:33:19,909 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 170 transitions, 1942 flow [2023-01-28 09:33:19,909 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-28 09:33:19,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:33:19,909 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-28 09:33:19,915 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-28 09:33:20,114 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-28 09:33:20,115 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-28 09:33:20,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:33:20,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2033487921, now seen corresponding path program 1 times [2023-01-28 09:33:20,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:33:20,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025619118] [2023-01-28 09:33:20,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:33:20,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:33:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:33:20,280 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-28 09:33:20,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:33:20,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025619118] [2023-01-28 09:33:20,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025619118] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:33:20,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307262700] [2023-01-28 09:33:20,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:33:20,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:33:20,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:33:20,282 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-28 09:33:20,283 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-28 09:33:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:33:20,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-28 09:33:20,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:33:20,387 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-28 09:33:20,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:33:20,455 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-28 09:33:20,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307262700] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:33:20,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:33:20,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2023-01-28 09:33:20,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217241659] [2023-01-28 09:33:20,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:33:20,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 09:33:20,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:33:20,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 09:33:20,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-01-28 09:33:20,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-28 09:33:20,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 170 transitions, 1942 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-28 09:33:20,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:33:20,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-28 09:33:20,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:33:21,106 INFO L130 PetriNetUnfolder]: 2784/4377 cut-off events. [2023-01-28 09:33:21,107 INFO L131 PetriNetUnfolder]: For 63286/63286 co-relation queries the response was YES. [2023-01-28 09:33:21,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29620 conditions, 4377 events. 2784/4377 cut-off events. For 63286/63286 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 24194 event pairs, 548 based on Foata normal form. 38/4415 useless extension candidates. Maximal degree in co-relation 27586. Up to 1534 conditions per place. [2023-01-28 09:33:21,144 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 225 selfloop transitions, 77 changer transitions 4/306 dead transitions. [2023-01-28 09:33:21,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 306 transitions, 3954 flow [2023-01-28 09:33:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 09:33:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 09:33:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 873 transitions. [2023-01-28 09:33:21,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47704918032786886 [2023-01-28 09:33:21,147 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 873 transitions. [2023-01-28 09:33:21,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 873 transitions. [2023-01-28 09:33:21,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:33:21,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 873 transitions. [2023-01-28 09:33:21,148 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-28 09:33:21,150 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-28 09:33:21,150 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-28 09:33:21,150 INFO L175 Difference]: Start difference. First operand has 107 places, 170 transitions, 1942 flow. Second operand 10 states and 873 transitions. [2023-01-28 09:33:21,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 306 transitions, 3954 flow [2023-01-28 09:33:21,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 306 transitions, 3702 flow, removed 126 selfloop flow, removed 0 redundant places. [2023-01-28 09:33:21,312 INFO L231 Difference]: Finished difference. Result has 121 places, 201 transitions, 2422 flow [2023-01-28 09:33:21,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2422, PETRI_PLACES=121, PETRI_TRANSITIONS=201} [2023-01-28 09:33:21,312 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 92 predicate places. [2023-01-28 09:33:21,312 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 201 transitions, 2422 flow [2023-01-28 09:33:21,313 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-28 09:33:21,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:33:21,313 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-28 09:33:21,333 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-28 09:33:21,517 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-28 09:33:21,517 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-28 09:33:21,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:33:21,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1972104569, now seen corresponding path program 2 times [2023-01-28 09:33:21,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:33:21,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710149187] [2023-01-28 09:33:21,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:33:21,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:33:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:33:21,629 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-28 09:33:21,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:33:21,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710149187] [2023-01-28 09:33:21,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710149187] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:33:21,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839872693] [2023-01-28 09:33:21,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 09:33:21,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:33:21,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:33:21,631 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-28 09:33:21,632 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-28 09:33:21,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 09:33:21,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:33:21,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-28 09:33:21,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:33:21,726 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-28 09:33:21,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:33:21,858 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-28 09:33:21,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839872693] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:33:21,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:33:21,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 10 [2023-01-28 09:33:21,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269321851] [2023-01-28 09:33:21,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:33:21,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 09:33:21,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:33:21,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 09:33:21,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-01-28 09:33:21,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-28 09:33:21,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 201 transitions, 2422 flow. Second operand has 10 states, 10 states have (on average 77.6) internal successors, (776), 10 states have internal predecessors, (776), 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-28 09:33:21,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:33:21,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-28 09:33:21,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:33:28,115 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-28 09:33:33,301 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-28 09:33:35,816 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-28 09:33:37,884 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-28 09:33:41,691 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-28 09:33:46,466 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-28 09:33:48,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-28 09:33:50,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:33:51,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:33:53,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:33:54,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:33:56,496 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-28 09:33:58,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:34:00,268 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-28 09:34:01,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:34:03,707 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-28 09:34:06,056 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-28 09:34:08,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-28 09:34:10,127 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-28 09:34:14,147 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-28 09:34:15,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:34:16,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:34:18,855 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-28 09:34:21,614 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-28 09:34:24,792 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-28 09:34:26,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:34:30,674 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-28 09:34:32,689 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-28 09:34:37,905 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-28 09:34:38,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:34:40,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:34:42,213 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-28 09:34:44,226 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-28 09:34:46,491 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-28 09:34:48,515 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_thread3Thread1of1ForFork0_~i~2 4294967296))) (and (forall ((aux_mod_~b~0_40 Int)) (or (< (mod c_thread2Thread1of1ForFork2_~i~1 4294967296) (mod (+ (* 4294967295 aux_mod_~b~0_40) 4294967295) 4294967296)) (< 4294967294 (+ .cse0 aux_mod_~b~0_40)) (> 0 aux_mod_~b~0_40))) (= c_thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* (div c_~a~0 4294967296) 4294967296) 1) c_~a~0) (< (+ c_~b~0 (* (div (+ 4294967295 (- c_~b~0)) 4294967296) 4294967296)) (+ .cse0 1)))) is different from false [2023-01-28 09:34:50,535 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-28 09:34:53,247 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-28 09:34:57,162 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-28 09:34:59,231 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-28 09:35:02,333 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-28 09:35:03,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:35:05,655 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-28 09:35:08,214 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-28 09:35:11,207 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-28 09:35:12,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:35:14,845 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-28 09:35:16,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:35:17,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:35:20,413 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-28 09:35:22,523 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-28 09:35:25,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:35:27,943 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-28 09:35:30,881 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-28 09:35:32,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:35:34,378 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-28 09:35:34,557 INFO L130 PetriNetUnfolder]: 3616/5687 cut-off events. [2023-01-28 09:35:34,558 INFO L131 PetriNetUnfolder]: For 98866/98866 co-relation queries the response was YES. [2023-01-28 09:35:34,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41056 conditions, 5687 events. 3616/5687 cut-off events. For 98866/98866 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 32763 event pairs, 615 based on Foata normal form. 20/5707 useless extension candidates. Maximal degree in co-relation 37985. Up to 2051 conditions per place. [2023-01-28 09:35:34,613 INFO L137 encePairwiseOnDemand]: 172/183 looper letters, 245 selfloop transitions, 167 changer transitions 2/414 dead transitions. [2023-01-28 09:35:34,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 414 transitions, 5680 flow [2023-01-28 09:35:34,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 09:35:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 09:35:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1221 transitions. [2023-01-28 09:35:34,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4765807962529274 [2023-01-28 09:35:34,619 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1221 transitions. [2023-01-28 09:35:34,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1221 transitions. [2023-01-28 09:35:34,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:35:34,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1221 transitions. [2023-01-28 09:35:34,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 87.21428571428571) internal successors, (1221), 14 states have internal predecessors, (1221), 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-28 09:35:34,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 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-28 09:35:34,627 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 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-28 09:35:34,627 INFO L175 Difference]: Start difference. First operand has 121 places, 201 transitions, 2422 flow. Second operand 14 states and 1221 transitions. [2023-01-28 09:35:34,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 414 transitions, 5680 flow [2023-01-28 09:35:34,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 414 transitions, 5554 flow, removed 41 selfloop flow, removed 1 redundant places. [2023-01-28 09:35:34,938 INFO L231 Difference]: Finished difference. Result has 143 places, 288 transitions, 4228 flow [2023-01-28 09:35:34,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2347, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4228, PETRI_PLACES=143, PETRI_TRANSITIONS=288} [2023-01-28 09:35:34,939 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 114 predicate places. [2023-01-28 09:35:34,939 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 288 transitions, 4228 flow [2023-01-28 09:35:34,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.6) internal successors, (776), 10 states have internal predecessors, (776), 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-28 09:35:34,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:35:34,941 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-28 09:35:34,946 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-28 09:35:35,146 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-28 09:35:35,147 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-28 09:35:35,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:35:35,147 INFO L85 PathProgramCache]: Analyzing trace with hash -245491509, now seen corresponding path program 5 times [2023-01-28 09:35:35,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:35:35,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853258879] [2023-01-28 09:35:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:35:35,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:35:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:35:35,318 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-28 09:35:35,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:35:35,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853258879] [2023-01-28 09:35:35,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853258879] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:35:35,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350107426] [2023-01-28 09:35:35,319 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 09:35:35,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:35:35,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:35:35,345 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-28 09:35:35,376 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-28 09:35:35,417 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 09:35:35,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:35:35,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2023-01-28 09:35:35,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:35:35,491 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-28 09:35:35,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:35:35,645 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-28 09:35:35,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350107426] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:35:35,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:35:35,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-01-28 09:35:35,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924542887] [2023-01-28 09:35:35,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:35:35,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 09:35:35,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:35:35,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 09:35:35,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-01-28 09:35:35,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-28 09:35:35,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 288 transitions, 4228 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-28 09:35:35,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:35:35,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-28 09:35:35,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:35:36,614 INFO L130 PetriNetUnfolder]: 3814/6089 cut-off events. [2023-01-28 09:35:36,614 INFO L131 PetriNetUnfolder]: For 133536/133536 co-relation queries the response was YES. [2023-01-28 09:35:36,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48833 conditions, 6089 events. 3814/6089 cut-off events. For 133536/133536 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 36372 event pairs, 760 based on Foata normal form. 32/6121 useless extension candidates. Maximal degree in co-relation 45469. Up to 2213 conditions per place. [2023-01-28 09:35:36,665 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 268 selfloop transitions, 190 changer transitions 3/461 dead transitions. [2023-01-28 09:35:36,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 461 transitions, 7343 flow [2023-01-28 09:35:36,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 09:35:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 09:35:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 873 transitions. [2023-01-28 09:35:36,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47704918032786886 [2023-01-28 09:35:36,667 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 873 transitions. [2023-01-28 09:35:36,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 873 transitions. [2023-01-28 09:35:36,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:35:36,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 873 transitions. [2023-01-28 09:35:36,669 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-28 09:35:36,671 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-28 09:35:36,671 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-28 09:35:36,671 INFO L175 Difference]: Start difference. First operand has 143 places, 288 transitions, 4228 flow. Second operand 10 states and 873 transitions. [2023-01-28 09:35:36,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 461 transitions, 7343 flow [2023-01-28 09:35:37,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 461 transitions, 7069 flow, removed 128 selfloop flow, removed 1 redundant places. [2023-01-28 09:35:37,204 INFO L231 Difference]: Finished difference. Result has 157 places, 341 transitions, 5560 flow [2023-01-28 09:35:37,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=4015, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5560, PETRI_PLACES=157, PETRI_TRANSITIONS=341} [2023-01-28 09:35:37,219 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 128 predicate places. [2023-01-28 09:35:37,220 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 341 transitions, 5560 flow [2023-01-28 09:35:37,220 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-28 09:35:37,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:35:37,220 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-28 09:35:37,228 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-28 09:35:37,424 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-28 09:35:37,424 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-28 09:35:37,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:35:37,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1351540861, now seen corresponding path program 3 times [2023-01-28 09:35:37,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:35:37,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325938644] [2023-01-28 09:35:37,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:35:37,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:35:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:35:37,585 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-28 09:35:37,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:35:37,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325938644] [2023-01-28 09:35:37,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325938644] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:35:37,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:35:37,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 09:35:37,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262270222] [2023-01-28 09:35:37,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:35:37,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 09:35:37,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:35:37,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 09:35:37,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 09:35:37,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-28 09:35:37,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 341 transitions, 5560 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-28 09:35:37,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:35:37,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-28 09:35:37,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:35:39,060 INFO L130 PetriNetUnfolder]: 3954/6350 cut-off events. [2023-01-28 09:35:39,060 INFO L131 PetriNetUnfolder]: For 152186/152186 co-relation queries the response was YES. [2023-01-28 09:35:39,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52464 conditions, 6350 events. 3954/6350 cut-off events. For 152186/152186 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 38873 event pairs, 1161 based on Foata normal form. 36/6384 useless extension candidates. Maximal degree in co-relation 51618. Up to 3326 conditions per place. [2023-01-28 09:35:39,126 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 374 selfloop transitions, 69 changer transitions 14/457 dead transitions. [2023-01-28 09:35:39,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 457 transitions, 8128 flow [2023-01-28 09:35:39,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 09:35:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 09:35:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 605 transitions. [2023-01-28 09:35:39,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722872755659641 [2023-01-28 09:35:39,129 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 605 transitions. [2023-01-28 09:35:39,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 605 transitions. [2023-01-28 09:35:39,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:35:39,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 605 transitions. [2023-01-28 09:35:39,131 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-28 09:35:39,132 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-28 09:35:39,133 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-28 09:35:39,133 INFO L175 Difference]: Start difference. First operand has 157 places, 341 transitions, 5560 flow. Second operand 7 states and 605 transitions. [2023-01-28 09:35:39,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 457 transitions, 8128 flow [2023-01-28 09:35:39,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 457 transitions, 7840 flow, removed 56 selfloop flow, removed 2 redundant places. [2023-01-28 09:35:39,712 INFO L231 Difference]: Finished difference. Result has 164 places, 349 transitions, 5713 flow [2023-01-28 09:35:39,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=5333, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5713, PETRI_PLACES=164, PETRI_TRANSITIONS=349} [2023-01-28 09:35:39,713 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 135 predicate places. [2023-01-28 09:35:39,713 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 349 transitions, 5713 flow [2023-01-28 09:35:39,714 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-28 09:35:39,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:35:39,714 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-28 09:35:39,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 09:35:39,714 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-28 09:35:39,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:35:39,715 INFO L85 PathProgramCache]: Analyzing trace with hash -469037225, now seen corresponding path program 6 times [2023-01-28 09:35:39,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:35:39,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353681654] [2023-01-28 09:35:39,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:35:39,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:35:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:35:39,882 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-28 09:35:39,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:35:39,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353681654] [2023-01-28 09:35:39,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353681654] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:35:39,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888666289] [2023-01-28 09:35:39,882 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 09:35:39,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:35:39,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:35:39,883 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-28 09:35:39,885 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-28 09:35:39,957 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-28 09:35:39,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:35:39,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-28 09:35:39,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:35:40,053 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-28 09:35:40,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:35:48,334 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-28 09:35:48,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888666289] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:35:48,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:35:48,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2023-01-28 09:35:48,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625988981] [2023-01-28 09:35:48,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:35:48,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-01-28 09:35:48,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:35:48,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-01-28 09:35:48,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=192, Unknown=3, NotChecked=0, Total=272 [2023-01-28 09:35:48,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-28 09:35:48,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 349 transitions, 5713 flow. Second operand has 17 states, 17 states have (on average 77.11764705882354) internal successors, (1311), 17 states have internal predecessors, (1311), 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-28 09:35:48,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:35:48,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-28 09:35:48,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:36:02,749 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-28 09:36:04,764 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-28 09:36:06,779 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-28 09:36:08,805 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-28 09:36:10,814 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-28 09:36:15,071 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_thread2Thread1of1ForFork2_~i~1 4294967296)) (.cse3 (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 ((.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) (< .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)))) (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 .cse3) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse4) (< .cse4 0) (let ((.cse5 (* aux_mod_aux_mod_~a~0_21_32 4294967295))) (< (+ .cse1 (* (div .cse5 4294967296) 4294967296)) .cse5)) (>= aux_mod_aux_mod_~a~0_21_32 4294967296)))) (or (let ((.cse6 (* 4294967295 c_~a~0))) (< (+ .cse1 (* (div .cse6 4294967296) 4294967296)) .cse6)) (< .cse3 (mod c_~a~0 4294967296))))) is different from false [2023-01-28 09:36:17,804 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-28 09:36:20,063 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-28 09:36:22,075 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-28 09:36:41,008 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-28 09:36:43,027 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-28 09:36:45,056 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-28 09:36:47,092 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-28 09:36:49,104 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-28 09:36:51,139 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-28 09:36:53,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-01-28 09:36:55,270 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-28 09:36:57,291 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-28 09:36:59,336 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)) (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 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (< (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)))) (let ((.cse4 (* 4294967295 c_~a~0))) (< (+ (* (div (+ .cse4 .cse0) 4294967296) 4294967296) .cse2) .cse4)))) is different from false [2023-01-28 09:37:01,346 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-28 09:37:03,369 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-28 09:37:05,392 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-28 09:37:07,457 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-28 09:37:09,877 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-28 09:37:11,952 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-28 09:37:13,958 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-28 09:37:16,177 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-28 09:37:18,241 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-28 09:37:20,282 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-28 09:37:21,048 INFO L130 PetriNetUnfolder]: 6178/9769 cut-off events. [2023-01-28 09:37:21,048 INFO L131 PetriNetUnfolder]: For 206182/206182 co-relation queries the response was YES. [2023-01-28 09:37:21,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78939 conditions, 9769 events. 6178/9769 cut-off events. For 206182/206182 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 62246 event pairs, 986 based on Foata normal form. 40/9807 useless extension candidates. Maximal degree in co-relation 78581. Up to 3608 conditions per place. [2023-01-28 09:37:21,125 INFO L137 encePairwiseOnDemand]: 168/183 looper letters, 505 selfloop transitions, 289 changer transitions 2/796 dead transitions. [2023-01-28 09:37:21,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 796 transitions, 12878 flow [2023-01-28 09:37:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-01-28 09:37:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-01-28 09:37:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2155 transitions. [2023-01-28 09:37:21,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4710382513661202 [2023-01-28 09:37:21,143 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2155 transitions. [2023-01-28 09:37:21,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2155 transitions. [2023-01-28 09:37:21,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:37:21,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2155 transitions. [2023-01-28 09:37:21,146 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-28 09:37:21,150 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-28 09:37:21,151 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-28 09:37:21,151 INFO L175 Difference]: Start difference. First operand has 164 places, 349 transitions, 5713 flow. Second operand 25 states and 2155 transitions. [2023-01-28 09:37:21,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 796 transitions, 12878 flow [2023-01-28 09:37:21,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 796 transitions, 12700 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-01-28 09:37:21,982 INFO L231 Difference]: Finished difference. Result has 204 places, 510 transitions, 8988 flow [2023-01-28 09:37:21,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=5571, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=8988, PETRI_PLACES=204, PETRI_TRANSITIONS=510} [2023-01-28 09:37:21,983 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 175 predicate places. [2023-01-28 09:37:21,983 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 510 transitions, 8988 flow [2023-01-28 09:37:21,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 77.11764705882354) internal successors, (1311), 17 states have internal predecessors, (1311), 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-28 09:37:21,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:37:21,984 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-28 09:37:21,990 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-28 09:37:22,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:37:22,185 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-28 09:37:22,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:37:22,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1058226737, now seen corresponding path program 4 times [2023-01-28 09:37:22,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:37:22,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820348868] [2023-01-28 09:37:22,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:37:22,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:37:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:37:22,308 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-28 09:37:22,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:37:22,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820348868] [2023-01-28 09:37:22,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820348868] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:37:22,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290252693] [2023-01-28 09:37:22,309 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 09:37:22,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:37:22,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:37:22,310 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-28 09:37:22,312 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-28 09:37:22,384 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 09:37:22,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:37:22,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2023-01-28 09:37:22,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:37:22,419 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-28 09:37:22,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:37:22,496 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-28 09:37:22,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290252693] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:37:22,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:37:22,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-01-28 09:37:22,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981206122] [2023-01-28 09:37:22,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:37:22,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-28 09:37:22,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:37:22,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-28 09:37:22,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-01-28 09:37:22,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-28 09:37:22,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 510 transitions, 8988 flow. Second operand has 11 states, 11 states have (on average 77.54545454545455) internal successors, (853), 11 states have internal predecessors, (853), 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-28 09:37:22,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:37:22,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-28 09:37:22,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:37:24,834 INFO L130 PetriNetUnfolder]: 6154/9717 cut-off events. [2023-01-28 09:37:24,844 INFO L131 PetriNetUnfolder]: For 311654/311654 co-relation queries the response was YES. [2023-01-28 09:37:24,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96173 conditions, 9717 events. 6154/9717 cut-off events. For 311654/311654 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 61997 event pairs, 1896 based on Foata normal form. 16/9731 useless extension candidates. Maximal degree in co-relation 95169. Up to 6502 conditions per place. [2023-01-28 09:37:24,983 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 529 selfloop transitions, 80 changer transitions 2/611 dead transitions. [2023-01-28 09:37:24,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 611 transitions, 11701 flow [2023-01-28 09:37:24,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 09:37:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 09:37:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 603 transitions. [2023-01-28 09:37:24,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707259953161593 [2023-01-28 09:37:24,985 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 603 transitions. [2023-01-28 09:37:24,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 603 transitions. [2023-01-28 09:37:24,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:37:24,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 603 transitions. [2023-01-28 09:37:24,986 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-28 09:37:24,987 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-28 09:37:24,987 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-28 09:37:24,987 INFO L175 Difference]: Start difference. First operand has 204 places, 510 transitions, 8988 flow. Second operand 7 states and 603 transitions. [2023-01-28 09:37:24,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 611 transitions, 11701 flow [2023-01-28 09:37:26,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 611 transitions, 11227 flow, removed 237 selfloop flow, removed 0 redundant places. [2023-01-28 09:37:26,061 INFO L231 Difference]: Finished difference. Result has 213 places, 515 transitions, 8820 flow [2023-01-28 09:37:26,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=8506, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8820, PETRI_PLACES=213, PETRI_TRANSITIONS=515} [2023-01-28 09:37:26,062 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 184 predicate places. [2023-01-28 09:37:26,062 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 515 transitions, 8820 flow [2023-01-28 09:37:26,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 77.54545454545455) internal successors, (853), 11 states have internal predecessors, (853), 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-28 09:37:26,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:37:26,063 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-28 09:37:26,073 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-28 09:37:26,265 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-28 09:37:26,265 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-28 09:37:26,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:37:26,265 INFO L85 PathProgramCache]: Analyzing trace with hash 970126799, now seen corresponding path program 7 times [2023-01-28 09:37:26,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:37:26,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860249344] [2023-01-28 09:37:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:37:26,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:37:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:37:26,394 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-28 09:37:26,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:37:26,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860249344] [2023-01-28 09:37:26,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860249344] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:37:26,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110577668] [2023-01-28 09:37:26,394 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 09:37:26,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:37:26,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:37:26,409 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-28 09:37:26,410 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-28 09:37:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:37:26,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-28 09:37:26,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:37:26,671 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-28 09:37:26,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:37:26,771 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-28 09:37:26,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110577668] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 09:37:26,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 09:37:26,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 14 [2023-01-28 09:37:26,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026720332] [2023-01-28 09:37:26,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:37:26,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 09:37:26,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:37:26,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 09:37:26,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-01-28 09:37:26,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 183 [2023-01-28 09:37:26,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 515 transitions, 8820 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-28 09:37:26,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:37:26,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 183 [2023-01-28 09:37:26,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:37:29,441 INFO L130 PetriNetUnfolder]: 6497/10308 cut-off events. [2023-01-28 09:37:29,442 INFO L131 PetriNetUnfolder]: For 321451/321582 co-relation queries the response was YES. [2023-01-28 09:37:29,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100256 conditions, 10308 events. 6497/10308 cut-off events. For 321451/321582 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 67098 event pairs, 1164 based on Foata normal form. 59/10324 useless extension candidates. Maximal degree in co-relation 99768. Up to 3764 conditions per place. [2023-01-28 09:37:29,646 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 456 selfloop transitions, 204 changer transitions 1/671 dead transitions. [2023-01-28 09:37:29,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 671 transitions, 12311 flow [2023-01-28 09:37:29,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 09:37:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 09:37:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 729 transitions. [2023-01-28 09:37:29,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979508196721312 [2023-01-28 09:37:29,648 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 729 transitions. [2023-01-28 09:37:29,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 729 transitions. [2023-01-28 09:37:29,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:37:29,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 729 transitions. [2023-01-28 09:37:29,649 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-28 09:37:29,650 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-28 09:37:29,651 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-28 09:37:29,651 INFO L175 Difference]: Start difference. First operand has 213 places, 515 transitions, 8820 flow. Second operand 8 states and 729 transitions. [2023-01-28 09:37:29,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 671 transitions, 12311 flow [2023-01-28 09:37:30,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 671 transitions, 12157 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-01-28 09:37:30,599 INFO L231 Difference]: Finished difference. Result has 221 places, 549 transitions, 9991 flow [2023-01-28 09:37:30,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=8678, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9991, PETRI_PLACES=221, PETRI_TRANSITIONS=549} [2023-01-28 09:37:30,600 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 192 predicate places. [2023-01-28 09:37:30,600 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 549 transitions, 9991 flow [2023-01-28 09:37:30,600 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-28 09:37:30,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:37:30,600 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-28 09:37:30,606 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-28 09:37:30,805 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,SelfDestructingSolverStorable11 [2023-01-28 09:37:30,805 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-28 09:37:30,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:37:30,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1595331425, now seen corresponding path program 1 times [2023-01-28 09:37:30,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:37:30,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153009329] [2023-01-28 09:37:30,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:37:30,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:37:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:37:30,945 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-28 09:37:30,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:37:30,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153009329] [2023-01-28 09:37:30,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153009329] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:37:30,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:37:30,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 09:37:30,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686588542] [2023-01-28 09:37:30,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:37:30,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 09:37:30,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:37:30,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 09:37:30,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 09:37:30,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-28 09:37:30,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 549 transitions, 9991 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-28 09:37:30,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:37:30,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-28 09:37:30,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:37:34,004 INFO L130 PetriNetUnfolder]: 6823/10863 cut-off events. [2023-01-28 09:37:34,004 INFO L131 PetriNetUnfolder]: For 361454/361454 co-relation queries the response was YES. [2023-01-28 09:37:34,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108175 conditions, 10863 events. 6823/10863 cut-off events. For 361454/361454 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 71621 event pairs, 2108 based on Foata normal form. 32/10893 useless extension candidates. Maximal degree in co-relation 107683. Up to 7238 conditions per place. [2023-01-28 09:37:34,159 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 528 selfloop transitions, 128 changer transitions 9/665 dead transitions. [2023-01-28 09:37:34,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 665 transitions, 13190 flow [2023-01-28 09:37:34,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 09:37:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 09:37:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 606 transitions. [2023-01-28 09:37:34,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47306791569086654 [2023-01-28 09:37:34,161 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 606 transitions. [2023-01-28 09:37:34,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 606 transitions. [2023-01-28 09:37:34,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:37:34,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 606 transitions. [2023-01-28 09:37:34,162 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-28 09:37:34,164 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-28 09:37:34,164 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-28 09:37:34,164 INFO L175 Difference]: Start difference. First operand has 221 places, 549 transitions, 9991 flow. Second operand 7 states and 606 transitions. [2023-01-28 09:37:34,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 665 transitions, 13190 flow [2023-01-28 09:37:35,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 665 transitions, 13176 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-01-28 09:37:35,872 INFO L231 Difference]: Finished difference. Result has 232 places, 580 transitions, 11146 flow [2023-01-28 09:37:35,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=9977, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11146, PETRI_PLACES=232, PETRI_TRANSITIONS=580} [2023-01-28 09:37:35,873 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 203 predicate places. [2023-01-28 09:37:35,873 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 580 transitions, 11146 flow [2023-01-28 09:37:35,873 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-28 09:37:35,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:37:35,874 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-28 09:37:35,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 09:37:35,874 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-28 09:37:35,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:37:35,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1187761213, now seen corresponding path program 8 times [2023-01-28 09:37:35,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:37:35,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454588763] [2023-01-28 09:37:35,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:37:35,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:37:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:37:36,045 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-28 09:37:36,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:37:36,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454588763] [2023-01-28 09:37:36,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454588763] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:37:36,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698748919] [2023-01-28 09:37:36,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 09:37:36,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:37:36,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:37:36,047 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-28 09:37:36,049 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-28 09:37:36,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 09:37:36,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:37:36,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-28 09:37:36,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:37:36,310 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-28 09:37:36,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:37:36,472 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-28 09:37:36,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698748919] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 09:37:36,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 09:37:36,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 15 [2023-01-28 09:37:36,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807229932] [2023-01-28 09:37:36,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:37:36,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 09:37:36,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:37:36,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 09:37:36,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-01-28 09:37:36,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 183 [2023-01-28 09:37:36,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 580 transitions, 11146 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-28 09:37:36,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:37:36,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 183 [2023-01-28 09:37:36,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:37:39,537 INFO L130 PetriNetUnfolder]: 6685/10626 cut-off events. [2023-01-28 09:37:39,537 INFO L131 PetriNetUnfolder]: For 383534/383681 co-relation queries the response was YES. [2023-01-28 09:37:39,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109182 conditions, 10626 events. 6685/10626 cut-off events. For 383534/383681 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 69732 event pairs, 1760 based on Foata normal form. 50/10640 useless extension candidates. Maximal degree in co-relation 108678. Up to 5478 conditions per place. [2023-01-28 09:37:39,709 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 530 selfloop transitions, 109 changer transitions 1/650 dead transitions. [2023-01-28 09:37:39,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 650 transitions, 13367 flow [2023-01-28 09:37:39,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 09:37:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 09:37:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions. [2023-01-28 09:37:39,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972677595628415 [2023-01-28 09:37:39,711 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 546 transitions. [2023-01-28 09:37:39,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 546 transitions. [2023-01-28 09:37:39,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:37:39,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 546 transitions. [2023-01-28 09:37:39,713 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-28 09:37:39,714 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-28 09:37:39,714 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-28 09:37:39,714 INFO L175 Difference]: Start difference. First operand has 232 places, 580 transitions, 11146 flow. Second operand 6 states and 546 transitions. [2023-01-28 09:37:39,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 650 transitions, 13367 flow [2023-01-28 09:37:41,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 650 transitions, 13285 flow, removed 41 selfloop flow, removed 1 redundant places. [2023-01-28 09:37:41,616 INFO L231 Difference]: Finished difference. Result has 238 places, 583 transitions, 11435 flow [2023-01-28 09:37:41,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=11064, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11435, PETRI_PLACES=238, PETRI_TRANSITIONS=583} [2023-01-28 09:37:41,617 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 209 predicate places. [2023-01-28 09:37:41,617 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 583 transitions, 11435 flow [2023-01-28 09:37:41,618 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-28 09:37:41,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:37:41,618 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-28 09:37:41,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-28 09:37:41,822 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-28 09:37:41,823 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-28 09:37:41,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:37:41,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1618282389, now seen corresponding path program 9 times [2023-01-28 09:37:41,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:37:41,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588725311] [2023-01-28 09:37:41,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:37:41,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:37:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:37:41,972 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-28 09:37:41,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:37:41,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588725311] [2023-01-28 09:37:41,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588725311] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:37:41,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19874264] [2023-01-28 09:37:41,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 09:37:41,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:37:41,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:37:41,974 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-28 09:37:41,977 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-28 09:37:42,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 09:37:42,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:37:42,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-28 09:37:42,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:37:42,230 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-28 09:37:42,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:37:42,320 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-28 09:37:42,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19874264] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 09:37:42,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 09:37:42,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 15 [2023-01-28 09:37:42,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544353364] [2023-01-28 09:37:42,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:37:42,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 09:37:42,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:37:42,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 09:37:42,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2023-01-28 09:37:42,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 183 [2023-01-28 09:37:42,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 583 transitions, 11435 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-28 09:37:42,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:37:42,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 183 [2023-01-28 09:37:42,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:37:45,466 INFO L130 PetriNetUnfolder]: 6665/10586 cut-off events. [2023-01-28 09:37:45,466 INFO L131 PetriNetUnfolder]: For 380937/381095 co-relation queries the response was YES. [2023-01-28 09:37:45,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109217 conditions, 10586 events. 6665/10586 cut-off events. For 380937/381095 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 69270 event pairs, 1756 based on Foata normal form. 42/10592 useless extension candidates. Maximal degree in co-relation 108710. Up to 5478 conditions per place. [2023-01-28 09:37:45,655 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 523 selfloop transitions, 112 changer transitions 1/646 dead transitions. [2023-01-28 09:37:45,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 646 transitions, 13561 flow [2023-01-28 09:37:45,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 09:37:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 09:37:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2023-01-28 09:37:45,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49544626593806923 [2023-01-28 09:37:45,657 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 544 transitions. [2023-01-28 09:37:45,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 544 transitions. [2023-01-28 09:37:45,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:37:45,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 544 transitions. [2023-01-28 09:37:45,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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-28 09:37:45,660 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-28 09:37:45,660 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-28 09:37:45,660 INFO L175 Difference]: Start difference. First operand has 238 places, 583 transitions, 11435 flow. Second operand 6 states and 544 transitions. [2023-01-28 09:37:45,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 646 transitions, 13561 flow [2023-01-28 09:37:47,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 646 transitions, 13407 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-01-28 09:37:47,637 INFO L231 Difference]: Finished difference. Result has 243 places, 584 transitions, 11582 flow [2023-01-28 09:37:47,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=11281, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11582, PETRI_PLACES=243, PETRI_TRANSITIONS=584} [2023-01-28 09:37:47,639 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 214 predicate places. [2023-01-28 09:37:47,639 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 584 transitions, 11582 flow [2023-01-28 09:37:47,639 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-28 09:37:47,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:37:47,640 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-28 09:37:47,647 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-28 09:37:47,847 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,SelfDestructingSolverStorable14 [2023-01-28 09:37:47,847 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-28 09:37:47,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:37:47,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2045915515, now seen corresponding path program 10 times [2023-01-28 09:37:47,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:37:47,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768447178] [2023-01-28 09:37:47,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:37:47,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:37:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:37:48,037 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-28 09:37:48,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:37:48,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768447178] [2023-01-28 09:37:48,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768447178] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:37:48,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823473823] [2023-01-28 09:37:48,038 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 09:37:48,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:37:48,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:37:48,039 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-28 09:37:48,042 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-28 09:37:48,142 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 09:37:48,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:37:48,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2023-01-28 09:37:48,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:37:48,345 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-28 09:37:48,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:37:48,476 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-28 09:37:48,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823473823] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 09:37:48,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 09:37:48,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 17 [2023-01-28 09:37:48,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784478305] [2023-01-28 09:37:48,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:37:48,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 09:37:48,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:37:48,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 09:37:48,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-01-28 09:37:48,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 183 [2023-01-28 09:37:48,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 584 transitions, 11582 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-28 09:37:48,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:37:48,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 183 [2023-01-28 09:37:48,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:37:51,414 INFO L130 PetriNetUnfolder]: 6647/10538 cut-off events. [2023-01-28 09:37:51,415 INFO L131 PetriNetUnfolder]: For 383726/383884 co-relation queries the response was YES. [2023-01-28 09:37:51,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109193 conditions, 10538 events. 6647/10538 cut-off events. For 383726/383884 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 68753 event pairs, 1645 based on Foata normal form. 38/10540 useless extension candidates. Maximal degree in co-relation 108684. Up to 5168 conditions per place. [2023-01-28 09:37:51,586 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 505 selfloop transitions, 143 changer transitions 1/659 dead transitions. [2023-01-28 09:37:51,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 659 transitions, 13850 flow [2023-01-28 09:37:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 09:37:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 09:37:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2023-01-28 09:37:51,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918032786885246 [2023-01-28 09:37:51,588 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2023-01-28 09:37:51,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2023-01-28 09:37:51,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:37:51,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2023-01-28 09:37:51,589 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-28 09:37:51,591 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-28 09:37:51,591 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-28 09:37:51,591 INFO L175 Difference]: Start difference. First operand has 243 places, 584 transitions, 11582 flow. Second operand 6 states and 540 transitions. [2023-01-28 09:37:51,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 659 transitions, 13850 flow [2023-01-28 09:37:53,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 659 transitions, 13644 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-01-28 09:37:53,485 INFO L231 Difference]: Finished difference. Result has 248 places, 586 transitions, 11818 flow [2023-01-28 09:37:53,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=11378, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11818, PETRI_PLACES=248, PETRI_TRANSITIONS=586} [2023-01-28 09:37:53,486 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 219 predicate places. [2023-01-28 09:37:53,486 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 586 transitions, 11818 flow [2023-01-28 09:37:53,486 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-28 09:37:53,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:37:53,486 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-28 09:37:53,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-28 09:37:53,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-28 09:37:53,688 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-28 09:37:53,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:37:53,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1543476489, now seen corresponding path program 2 times [2023-01-28 09:37:53,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:37:53,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550563382] [2023-01-28 09:37:53,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:37:53,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:37:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:37:53,801 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-28 09:37:53,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:37:53,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550563382] [2023-01-28 09:37:53,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550563382] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:37:53,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:37:53,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 09:37:53,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580885682] [2023-01-28 09:37:53,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:37:53,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 09:37:53,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:37:53,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 09:37:53,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-28 09:37:53,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-28 09:37:53,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 586 transitions, 11818 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-28 09:37:53,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:37:53,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-28 09:37:53,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:37:56,697 INFO L130 PetriNetUnfolder]: 6748/10774 cut-off events. [2023-01-28 09:37:56,698 INFO L131 PetriNetUnfolder]: For 395968/395968 co-relation queries the response was YES. [2023-01-28 09:37:56,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112009 conditions, 10774 events. 6748/10774 cut-off events. For 395968/395968 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 70974 event pairs, 1663 based on Foata normal form. 36/10808 useless extension candidates. Maximal degree in co-relation 111497. Up to 5317 conditions per place. [2023-01-28 09:37:57,015 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 441 selfloop transitions, 240 changer transitions 8/689 dead transitions. [2023-01-28 09:37:57,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 689 transitions, 14714 flow [2023-01-28 09:37:57,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 09:37:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 09:37:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 596 transitions. [2023-01-28 09:37:57,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652615144418423 [2023-01-28 09:37:57,017 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 596 transitions. [2023-01-28 09:37:57,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 596 transitions. [2023-01-28 09:37:57,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:37:57,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 596 transitions. [2023-01-28 09:37:57,019 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-28 09:37:57,020 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-28 09:37:57,021 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-28 09:37:57,021 INFO L175 Difference]: Start difference. First operand has 248 places, 586 transitions, 11818 flow. Second operand 7 states and 596 transitions. [2023-01-28 09:37:57,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 689 transitions, 14714 flow [2023-01-28 09:37:59,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 689 transitions, 14510 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-01-28 09:37:59,061 INFO L231 Difference]: Finished difference. Result has 257 places, 603 transitions, 12758 flow [2023-01-28 09:37:59,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=11614, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12758, PETRI_PLACES=257, PETRI_TRANSITIONS=603} [2023-01-28 09:37:59,062 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 228 predicate places. [2023-01-28 09:37:59,062 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 603 transitions, 12758 flow [2023-01-28 09:37:59,062 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-28 09:37:59,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:37:59,062 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-28 09:37:59,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-28 09:37:59,063 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-28 09:37:59,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:37:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash -331942833, now seen corresponding path program 5 times [2023-01-28 09:37:59,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:37:59,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725212883] [2023-01-28 09:37:59,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:37:59,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:37:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:37:59,233 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-28 09:37:59,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:37:59,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725212883] [2023-01-28 09:37:59,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725212883] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:37:59,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634858610] [2023-01-28 09:37:59,234 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 09:37:59,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:37:59,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:37:59,247 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-28 09:37:59,248 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-28 09:37:59,434 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 09:37:59,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:37:59,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 09:37:59,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:37:59,619 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-28 09:37:59,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:37:59,766 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-28 09:37:59,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634858610] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 09:37:59,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 09:37:59,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 8] total 17 [2023-01-28 09:37:59,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902037174] [2023-01-28 09:37:59,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:37:59,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 09:37:59,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:37:59,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 09:37:59,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-01-28 09:37:59,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-28 09:37:59,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 603 transitions, 12758 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-28 09:37:59,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:37:59,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-28 09:37:59,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:38:03,175 INFO L130 PetriNetUnfolder]: 7011/11212 cut-off events. [2023-01-28 09:38:03,175 INFO L131 PetriNetUnfolder]: For 450168/450168 co-relation queries the response was YES. [2023-01-28 09:38:03,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120895 conditions, 11212 events. 7011/11212 cut-off events. For 450168/450168 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 74766 event pairs, 1361 based on Foata normal form. 4/11214 useless extension candidates. Maximal degree in co-relation 120443. Up to 5472 conditions per place. [2023-01-28 09:38:03,373 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 434 selfloop transitions, 285 changer transitions 4/723 dead transitions. [2023-01-28 09:38:03,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 723 transitions, 16278 flow [2023-01-28 09:38:03,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 09:38:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 09:38:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 613 transitions. [2023-01-28 09:38:03,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785323965651834 [2023-01-28 09:38:03,375 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 613 transitions. [2023-01-28 09:38:03,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 613 transitions. [2023-01-28 09:38:03,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:38:03,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 613 transitions. [2023-01-28 09:38:03,376 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-28 09:38:03,378 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-28 09:38:03,378 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-28 09:38:03,378 INFO L175 Difference]: Start difference. First operand has 257 places, 603 transitions, 12758 flow. Second operand 7 states and 613 transitions. [2023-01-28 09:38:03,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 723 transitions, 16278 flow [2023-01-28 09:38:05,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 723 transitions, 15899 flow, removed 80 selfloop flow, removed 2 redundant places. [2023-01-28 09:38:05,226 INFO L231 Difference]: Finished difference. Result has 265 places, 638 transitions, 14293 flow [2023-01-28 09:38:05,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=12404, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=14293, PETRI_PLACES=265, PETRI_TRANSITIONS=638} [2023-01-28 09:38:05,227 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 236 predicate places. [2023-01-28 09:38:05,227 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 638 transitions, 14293 flow [2023-01-28 09:38:05,227 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-28 09:38:05,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:38:05,227 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-28 09:38:05,233 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-28 09:38:05,431 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,SelfDestructingSolverStorable17 [2023-01-28 09:38:05,431 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-28 09:38:05,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:38:05,431 INFO L85 PathProgramCache]: Analyzing trace with hash 880532511, now seen corresponding path program 3 times [2023-01-28 09:38:05,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:38:05,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340695189] [2023-01-28 09:38:05,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:38:05,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:38:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:38:05,573 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-28 09:38:05,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:38:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340695189] [2023-01-28 09:38:05,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340695189] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:38:05,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:38:05,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 09:38:05,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373218318] [2023-01-28 09:38:05,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:38:05,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 09:38:05,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:38:05,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 09:38:05,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 09:38:05,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 183 [2023-01-28 09:38:05,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 638 transitions, 14293 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-28 09:38:05,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:38:05,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 183 [2023-01-28 09:38:05,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:38:09,342 INFO L130 PetriNetUnfolder]: 6984/11153 cut-off events. [2023-01-28 09:38:09,343 INFO L131 PetriNetUnfolder]: For 478839/478839 co-relation queries the response was YES. [2023-01-28 09:38:09,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122096 conditions, 11153 events. 6984/11153 cut-off events. For 478839/478839 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 74188 event pairs, 2066 based on Foata normal form. 12/11165 useless extension candidates. Maximal degree in co-relation 121008. Up to 7088 conditions per place. [2023-01-28 09:38:09,555 INFO L137 encePairwiseOnDemand]: 175/183 looper letters, 592 selfloop transitions, 114 changer transitions 14/720 dead transitions. [2023-01-28 09:38:09,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 720 transitions, 16958 flow [2023-01-28 09:38:09,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 09:38:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 09:38:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 600 transitions. [2023-01-28 09:38:09,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.468384074941452 [2023-01-28 09:38:09,557 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 600 transitions. [2023-01-28 09:38:09,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 600 transitions. [2023-01-28 09:38:09,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:38:09,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 600 transitions. [2023-01-28 09:38:09,559 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-28 09:38:09,560 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-28 09:38:09,560 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-28 09:38:09,560 INFO L175 Difference]: Start difference. First operand has 265 places, 638 transitions, 14293 flow. Second operand 7 states and 600 transitions. [2023-01-28 09:38:09,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 720 transitions, 16958 flow [2023-01-28 09:38:12,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 720 transitions, 16742 flow, removed 53 selfloop flow, removed 1 redundant places. [2023-01-28 09:38:12,130 INFO L231 Difference]: Finished difference. Result has 273 places, 638 transitions, 14342 flow [2023-01-28 09:38:12,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=14077, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=14342, PETRI_PLACES=273, PETRI_TRANSITIONS=638} [2023-01-28 09:38:12,131 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 244 predicate places. [2023-01-28 09:38:12,131 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 638 transitions, 14342 flow [2023-01-28 09:38:12,131 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-28 09:38:12,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:38:12,131 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-28 09:38:12,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-01-28 09:38:12,132 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-28 09:38:12,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:38:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash 594068329, now seen corresponding path program 6 times [2023-01-28 09:38:12,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:38:12,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089867047] [2023-01-28 09:38:12,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:38:12,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:38:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:38:12,253 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-28 09:38:12,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:38:12,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089867047] [2023-01-28 09:38:12,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089867047] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:38:12,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855036683] [2023-01-28 09:38:12,254 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 09:38:12,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:38:12,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:38:12,255 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-28 09:38:12,257 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-28 09:38:12,374 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-28 09:38:12,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:38:12,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 09:38:12,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:38:12,522 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-28 09:38:12,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:40:35,813 WARN L222 SmtUtils]: Spent 2.36m on a formula simplification. DAG size of input: 4214 DAG size of output: 3668 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-01-28 09:43:48,535 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 09:43:48,536 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-28 09:43:49,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-01-28 09:43:49,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown