/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 22:22:44,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 22:22:44,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 22:22:44,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 22:22:44,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 22:22:44,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 22:22:44,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 22:22:44,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 22:22:44,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 22:22:44,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 22:22:44,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 22:22:44,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 22:22:44,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 22:22:44,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 22:22:44,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 22:22:44,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 22:22:44,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 22:22:44,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 22:22:44,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 22:22:44,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 22:22:44,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 22:22:44,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 22:22:44,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 22:22:44,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 22:22:44,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 22:22:44,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 22:22:44,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 22:22:44,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 22:22:44,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 22:22:44,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 22:22:44,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 22:22:44,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 22:22:44,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 22:22:44,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 22:22:44,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 22:22:44,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 22:22:44,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 22:22:44,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 22:22:44,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 22:22:44,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 22:22:44,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 22:22:44,724 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 22:22:44,756 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 22:22:44,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 22:22:44,757 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 22:22:44,757 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 22:22:44,758 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 22:22:44,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 22:22:44,758 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 22:22:44,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 22:22:44,759 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 22:22:44,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 22:22:44,759 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 22:22:44,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 22:22:44,760 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 22:22:44,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 22:22:44,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 22:22:44,760 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 22:22:44,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 22:22:44,760 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 22:22:44,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 22:22:44,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 22:22:44,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 22:22:44,761 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 22:22:44,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 22:22:44,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 22:22:44,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 22:22:44,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 22:22:44,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 22:22:44,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 22:22:44,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 22:22:44,762 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 22:22:44,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 22:22:44,762 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-01-27 22:22:44,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 22:22:45,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 22:22:45,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 22:22:45,016 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 22:22:45,016 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 22:22:45,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2023-01-27 22:22:46,136 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 22:22:46,316 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 22:22:46,317 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2023-01-27 22:22:46,322 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36594c318/a2239b0bd446450987e6f720050d425c/FLAGa2b0b8f8d [2023-01-27 22:22:46,333 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36594c318/a2239b0bd446450987e6f720050d425c [2023-01-27 22:22:46,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 22:22:46,336 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 22:22:46,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 22:22:46,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 22:22:46,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 22:22:46,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 10:22:46" (1/1) ... [2023-01-27 22:22:46,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a9bfd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:22:46, skipping insertion in model container [2023-01-27 22:22:46,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 10:22:46" (1/1) ... [2023-01-27 22:22:46,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 22:22:46,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 22:22:46,544 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/popl20-more-sorted.wvr.c[2434,2447] [2023-01-27 22:22:46,553 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 22:22:46,561 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 22:22:46,596 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/popl20-more-sorted.wvr.c[2434,2447] [2023-01-27 22:22:46,599 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 22:22:46,613 INFO L208 MainTranslator]: Completed translation [2023-01-27 22:22:46,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:22:46 WrapperNode [2023-01-27 22:22:46,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 22:22:46,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 22:22:46,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 22:22:46,616 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 22:22:46,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:22:46" (1/1) ... [2023-01-27 22:22:46,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:22:46" (1/1) ... [2023-01-27 22:22:46,664 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 108 [2023-01-27 22:22:46,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 22:22:46,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 22:22:46,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 22:22:46,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 22:22:46,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:22:46" (1/1) ... [2023-01-27 22:22:46,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:22:46" (1/1) ... [2023-01-27 22:22:46,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:22:46" (1/1) ... [2023-01-27 22:22:46,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:22:46" (1/1) ... [2023-01-27 22:22:46,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:22:46" (1/1) ... [2023-01-27 22:22:46,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:22:46" (1/1) ... [2023-01-27 22:22:46,702 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:22:46" (1/1) ... [2023-01-27 22:22:46,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:22:46" (1/1) ... [2023-01-27 22:22:46,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 22:22:46,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 22:22:46,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 22:22:46,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 22:22:46,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:22:46" (1/1) ... [2023-01-27 22:22:46,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 22:22:46,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:22:46,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 22:22:46,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 22:22:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 22:22:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 22:22:46,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 22:22:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 22:22:46,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 22:22:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-27 22:22:46,767 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-27 22:22:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 22:22:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 22:22:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 22:22:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 22:22:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 22:22:46,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 22:22:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 22:22:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 22:22:46,770 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 22:22:46,870 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 22:22:46,872 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 22:22:47,087 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 22:22:47,110 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 22:22:47,111 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-27 22:22:47,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 10:22:47 BoogieIcfgContainer [2023-01-27 22:22:47,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 22:22:47,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 22:22:47,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 22:22:47,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 22:22:47,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 10:22:46" (1/3) ... [2023-01-27 22:22:47,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d1d6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 10:22:47, skipping insertion in model container [2023-01-27 22:22:47,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:22:46" (2/3) ... [2023-01-27 22:22:47,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d1d6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 10:22:47, skipping insertion in model container [2023-01-27 22:22:47,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 10:22:47" (3/3) ... [2023-01-27 22:22:47,119 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2023-01-27 22:22:47,154 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 22:22:47,154 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 22:22:47,154 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 22:22:47,269 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-27 22:22:47,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 175 transitions, 374 flow [2023-01-27 22:22:47,389 INFO L130 PetriNetUnfolder]: 15/172 cut-off events. [2023-01-27 22:22:47,390 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 22:22:47,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 172 events. 15/172 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 204 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2023-01-27 22:22:47,398 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 175 transitions, 374 flow [2023-01-27 22:22:47,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 162 transitions, 342 flow [2023-01-27 22:22:47,409 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 22:22:47,416 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 162 transitions, 342 flow [2023-01-27 22:22:47,418 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 162 transitions, 342 flow [2023-01-27 22:22:47,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 162 transitions, 342 flow [2023-01-27 22:22:47,452 INFO L130 PetriNetUnfolder]: 15/162 cut-off events. [2023-01-27 22:22:47,452 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 22:22:47,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 162 events. 15/162 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2023-01-27 22:22:47,456 INFO L119 LiptonReduction]: Number of co-enabled transitions 3534 [2023-01-27 22:22:52,542 INFO L134 LiptonReduction]: Checked pairs total: 4092 [2023-01-27 22:22:52,542 INFO L136 LiptonReduction]: Total number of compositions: 166 [2023-01-27 22:22:52,554 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 22:22:52,559 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;@6b403610, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 22:22:52,559 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-27 22:22:52,566 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2023-01-27 22:22:52,566 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 22:22:52,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:22:52,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:22:52,567 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:22:52,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:22:52,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1548535715, now seen corresponding path program 1 times [2023-01-27 22:22:52,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:22:52,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73617606] [2023-01-27 22:22:52,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:22:52,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:22:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:22:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:22:53,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:22:53,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73617606] [2023-01-27 22:22:53,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73617606] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:22:53,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:22:53,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 22:22:53,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373463028] [2023-01-27 22:22:53,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:22:53,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 22:22:53,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:22:53,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 22:22:53,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 22:22:53,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 341 [2023-01-27 22:22:53,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:53,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:22:53,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 341 [2023-01-27 22:22:53,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:22:53,310 INFO L130 PetriNetUnfolder]: 543/714 cut-off events. [2023-01-27 22:22:53,310 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-01-27 22:22:53,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 714 events. 543/714 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2207 event pairs, 212 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 1213. Up to 697 conditions per place. [2023-01-27 22:22:53,319 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 24 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-01-27 22:22:53,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 128 flow [2023-01-27 22:22:53,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 22:22:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 22:22:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-01-27 22:22:53,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4398826979472141 [2023-01-27 22:22:53,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-01-27 22:22:53,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-01-27 22:22:53,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:22:53,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-01-27 22:22:53,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:53,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:53,351 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:53,352 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 3 states and 450 transitions. [2023-01-27 22:22:53,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 128 flow [2023-01-27 22:22:53,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-01-27 22:22:53,359 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 74 flow [2023-01-27 22:22:53,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2023-01-27 22:22:53,363 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2023-01-27 22:22:53,364 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 74 flow [2023-01-27 22:22:53,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:53,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:22:53,365 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, 1] [2023-01-27 22:22:53,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 22:22:53,365 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:22:53,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:22:53,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2004951010, now seen corresponding path program 1 times [2023-01-27 22:22:53,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:22:53,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914168407] [2023-01-27 22:22:53,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:22:53,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:22:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:22:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:22:53,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:22:53,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914168407] [2023-01-27 22:22:53,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914168407] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:22:53,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:22:53,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 22:22:53,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850482852] [2023-01-27 22:22:53,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:22:53,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 22:22:53,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:22:53,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 22:22:53,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 22:22:53,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 341 [2023-01-27 22:22:53,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:53,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:22:53,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 341 [2023-01-27 22:22:53,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:22:53,886 INFO L130 PetriNetUnfolder]: 753/1008 cut-off events. [2023-01-27 22:22:53,886 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-01-27 22:22:53,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2043 conditions, 1008 events. 753/1008 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3502 event pairs, 95 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 2032. Up to 825 conditions per place. [2023-01-27 22:22:53,892 INFO L137 encePairwiseOnDemand]: 334/341 looper letters, 39 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2023-01-27 22:22:53,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 47 transitions, 203 flow [2023-01-27 22:22:53,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 22:22:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 22:22:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2023-01-27 22:22:53,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4760508308895406 [2023-01-27 22:22:53,894 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2023-01-27 22:22:53,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2023-01-27 22:22:53,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:22:53,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2023-01-27 22:22:53,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:53,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:53,898 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:53,898 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 74 flow. Second operand 3 states and 487 transitions. [2023-01-27 22:22:53,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 47 transitions, 203 flow [2023-01-27 22:22:53,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 199 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 22:22:53,900 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 100 flow [2023-01-27 22:22:53,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2023-01-27 22:22:53,901 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-01-27 22:22:53,901 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 100 flow [2023-01-27 22:22:53,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:53,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:22:53,902 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, 1, 1] [2023-01-27 22:22:53,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 22:22:53,902 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:22:53,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:22:53,902 INFO L85 PathProgramCache]: Analyzing trace with hash 610154948, now seen corresponding path program 1 times [2023-01-27 22:22:53,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:22:53,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264673570] [2023-01-27 22:22:53,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:22:53,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:22:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:22:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:22:54,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:22:54,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264673570] [2023-01-27 22:22:54,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264673570] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:22:54,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064779948] [2023-01-27 22:22:54,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:22:54,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:22:54,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:22:54,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:22:54,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-27 22:22:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:22:54,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-27 22:22:54,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:22:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:22:54,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:22:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:22:54,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064779948] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:22:54,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:22:54,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-27 22:22:54,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800082204] [2023-01-27 22:22:54,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:22:54,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-27 22:22:54,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:22:54,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-27 22:22:54,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-01-27 22:22:54,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 341 [2023-01-27 22:22:54,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 100 flow. Second operand has 12 states, 12 states have (on average 135.33333333333334) internal successors, (1624), 12 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:54,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:22:54,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 341 [2023-01-27 22:22:54,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:22:55,096 INFO L130 PetriNetUnfolder]: 1451/1990 cut-off events. [2023-01-27 22:22:55,097 INFO L131 PetriNetUnfolder]: For 456/458 co-relation queries the response was YES. [2023-01-27 22:22:55,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 1990 events. 1451/1990 cut-off events. For 456/458 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8476 event pairs, 397 based on Foata normal form. 66/1680 useless extension candidates. Maximal degree in co-relation 2520. Up to 758 conditions per place. [2023-01-27 22:22:55,108 INFO L137 encePairwiseOnDemand]: 335/341 looper letters, 80 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2023-01-27 22:22:55,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 88 transitions, 445 flow [2023-01-27 22:22:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 22:22:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 22:22:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1002 transitions. [2023-01-27 22:22:55,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4197737746124843 [2023-01-27 22:22:55,111 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1002 transitions. [2023-01-27 22:22:55,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1002 transitions. [2023-01-27 22:22:55,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:22:55,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1002 transitions. [2023-01-27 22:22:55,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.14285714285714) internal successors, (1002), 7 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:55,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:55,118 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:55,118 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 100 flow. Second operand 7 states and 1002 transitions. [2023-01-27 22:22:55,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 88 transitions, 445 flow [2023-01-27 22:22:55,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 88 transitions, 434 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 22:22:55,121 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 143 flow [2023-01-27 22:22:55,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2023-01-27 22:22:55,122 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-01-27 22:22:55,122 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 143 flow [2023-01-27 22:22:55,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 135.33333333333334) internal successors, (1624), 12 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:55,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:22:55,123 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, 1, 1, 1] [2023-01-27 22:22:55,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-27 22:22:55,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:22:55,330 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:22:55,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:22:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash -141297123, now seen corresponding path program 1 times [2023-01-27 22:22:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:22:55,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306320532] [2023-01-27 22:22:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:22:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:22:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:22:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:22:55,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:22:55,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306320532] [2023-01-27 22:22:55,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306320532] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:22:55,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500552021] [2023-01-27 22:22:55,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:22:55,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:22:55,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:22:55,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:22:55,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-27 22:22:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:22:55,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-01-27 22:22:55,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:22:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:22:55,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:22:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:22:55,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500552021] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:22:55,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:22:55,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-27 22:22:55,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075214193] [2023-01-27 22:22:55,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:22:55,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-27 22:22:55,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:22:55,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-27 22:22:55,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-01-27 22:22:55,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 341 [2023-01-27 22:22:55,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 143 flow. Second operand has 12 states, 12 states have (on average 138.58333333333334) internal successors, (1663), 12 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:55,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:22:55,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 341 [2023-01-27 22:22:55,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:22:55,913 INFO L130 PetriNetUnfolder]: 942/1371 cut-off events. [2023-01-27 22:22:55,914 INFO L131 PetriNetUnfolder]: For 627/679 co-relation queries the response was YES. [2023-01-27 22:22:55,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3520 conditions, 1371 events. 942/1371 cut-off events. For 627/679 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5932 event pairs, 343 based on Foata normal form. 64/1230 useless extension candidates. Maximal degree in co-relation 2541. Up to 612 conditions per place. [2023-01-27 22:22:55,922 INFO L137 encePairwiseOnDemand]: 334/341 looper letters, 70 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2023-01-27 22:22:55,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 424 flow [2023-01-27 22:22:55,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 22:22:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 22:22:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1023 transitions. [2023-01-27 22:22:55,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-01-27 22:22:55,925 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1023 transitions. [2023-01-27 22:22:55,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1023 transitions. [2023-01-27 22:22:55,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:22:55,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1023 transitions. [2023-01-27 22:22:55,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.14285714285714) internal successors, (1023), 7 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:55,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:55,931 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:55,931 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 143 flow. Second operand 7 states and 1023 transitions. [2023-01-27 22:22:55,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 424 flow [2023-01-27 22:22:55,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 79 transitions, 416 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-01-27 22:22:55,935 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 165 flow [2023-01-27 22:22:55,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=165, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-01-27 22:22:55,936 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2023-01-27 22:22:55,936 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 165 flow [2023-01-27 22:22:55,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 138.58333333333334) internal successors, (1663), 12 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:55,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:22:55,937 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, 1, 1, 1] [2023-01-27 22:22:55,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-27 22:22:56,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-01-27 22:22:56,146 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:22:56,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:22:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash -990089336, now seen corresponding path program 1 times [2023-01-27 22:22:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:22:56,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548556412] [2023-01-27 22:22:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:22:56,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:22:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:22:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:22:56,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:22:56,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548556412] [2023-01-27 22:22:56,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548556412] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:22:56,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707983169] [2023-01-27 22:22:56,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:22:56,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:22:56,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:22:56,429 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:22:56,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-27 22:22:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:22:56,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-27 22:22:56,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:22:56,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:22:56,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:22:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:22:56,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707983169] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:22:56,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:22:56,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-01-27 22:22:56,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256339499] [2023-01-27 22:22:56,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:22:56,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-27 22:22:56,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:22:56,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-27 22:22:56,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-01-27 22:22:56,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 341 [2023-01-27 22:22:56,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 165 flow. Second operand has 14 states, 14 states have (on average 134.28571428571428) internal successors, (1880), 14 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:56,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:22:56,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 341 [2023-01-27 22:22:56,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:22:57,067 INFO L130 PetriNetUnfolder]: 866/1245 cut-off events. [2023-01-27 22:22:57,067 INFO L131 PetriNetUnfolder]: For 854/879 co-relation queries the response was YES. [2023-01-27 22:22:57,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3613 conditions, 1245 events. 866/1245 cut-off events. For 854/879 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5045 event pairs, 330 based on Foata normal form. 25/1202 useless extension candidates. Maximal degree in co-relation 3135. Up to 795 conditions per place. [2023-01-27 22:22:57,074 INFO L137 encePairwiseOnDemand]: 335/341 looper letters, 42 selfloop transitions, 4 changer transitions 26/73 dead transitions. [2023-01-27 22:22:57,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 421 flow [2023-01-27 22:22:57,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 22:22:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 22:22:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 984 transitions. [2023-01-27 22:22:57,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4122329283619606 [2023-01-27 22:22:57,077 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 984 transitions. [2023-01-27 22:22:57,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 984 transitions. [2023-01-27 22:22:57,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:22:57,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 984 transitions. [2023-01-27 22:22:57,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.57142857142858) internal successors, (984), 7 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:57,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:57,082 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:57,083 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 165 flow. Second operand 7 states and 984 transitions. [2023-01-27 22:22:57,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 421 flow [2023-01-27 22:22:57,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 412 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-27 22:22:57,086 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 140 flow [2023-01-27 22:22:57,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2023-01-27 22:22:57,087 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-01-27 22:22:57,087 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 140 flow [2023-01-27 22:22:57,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 134.28571428571428) internal successors, (1880), 14 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:57,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:22:57,088 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:22:57,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-27 22:22:57,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:22:57,294 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:22:57,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:22:57,294 INFO L85 PathProgramCache]: Analyzing trace with hash -8956289, now seen corresponding path program 2 times [2023-01-27 22:22:57,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:22:57,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210919717] [2023-01-27 22:22:57,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:22:57,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:22:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:22:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:22:57,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:22:57,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210919717] [2023-01-27 22:22:57,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210919717] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:22:57,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422096414] [2023-01-27 22:22:57,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:22:57,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:22:57,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:22:57,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:22:57,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-27 22:22:57,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:22:57,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:22:57,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-01-27 22:22:57,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:22:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:22:57,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:22:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:22:57,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422096414] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 22:22:57,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 22:22:57,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2023-01-27 22:22:57,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150918735] [2023-01-27 22:22:57,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:22:57,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 22:22:57,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:22:57,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 22:22:57,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-01-27 22:22:57,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 341 [2023-01-27 22:22:57,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:57,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:22:57,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 341 [2023-01-27 22:22:57,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:22:57,762 INFO L130 PetriNetUnfolder]: 751/1009 cut-off events. [2023-01-27 22:22:57,762 INFO L131 PetriNetUnfolder]: For 744/746 co-relation queries the response was YES. [2023-01-27 22:22:57,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3120 conditions, 1009 events. 751/1009 cut-off events. For 744/746 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3415 event pairs, 155 based on Foata normal form. 48/1056 useless extension candidates. Maximal degree in co-relation 3082. Up to 583 conditions per place. [2023-01-27 22:22:57,768 INFO L137 encePairwiseOnDemand]: 334/341 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2023-01-27 22:22:57,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 289 flow [2023-01-27 22:22:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 22:22:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 22:22:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 858 transitions. [2023-01-27 22:22:57,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2023-01-27 22:22:57,771 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 858 transitions. [2023-01-27 22:22:57,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 858 transitions. [2023-01-27 22:22:57,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:22:57,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 858 transitions. [2023-01-27 22:22:57,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:57,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:57,776 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:57,776 INFO L175 Difference]: Start difference. First operand has 54 places, 33 transitions, 140 flow. Second operand 6 states and 858 transitions. [2023-01-27 22:22:57,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 289 flow [2023-01-27 22:22:57,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 243 flow, removed 12 selfloop flow, removed 13 redundant places. [2023-01-27 22:22:57,781 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 144 flow [2023-01-27 22:22:57,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-01-27 22:22:57,781 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-01-27 22:22:57,782 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 144 flow [2023-01-27 22:22:57,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:57,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:22:57,782 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:22:57,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-27 22:22:57,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:22:57,988 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:22:57,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:22:57,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1381542472, now seen corresponding path program 2 times [2023-01-27 22:22:57,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:22:57,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562908083] [2023-01-27 22:22:57,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:22:57,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:22:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:22:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:22:58,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:22:58,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562908083] [2023-01-27 22:22:58,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562908083] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:22:58,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497423456] [2023-01-27 22:22:58,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:22:58,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:22:58,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:22:58,155 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:22:58,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-27 22:22:58,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:22:58,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:22:58,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-27 22:22:58,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:22:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:22:58,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:22:58,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:22:58,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497423456] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 22:22:58,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 22:22:58,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2023-01-27 22:22:58,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283579883] [2023-01-27 22:22:58,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:22:58,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 22:22:58,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:22:58,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 22:22:58,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-01-27 22:22:58,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 341 [2023-01-27 22:22:58,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 144 flow. Second operand has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:58,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:22:58,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 341 [2023-01-27 22:22:58,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:22:58,735 INFO L130 PetriNetUnfolder]: 947/1306 cut-off events. [2023-01-27 22:22:58,736 INFO L131 PetriNetUnfolder]: For 1389/1577 co-relation queries the response was YES. [2023-01-27 22:22:58,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3955 conditions, 1306 events. 947/1306 cut-off events. For 1389/1577 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4851 event pairs, 242 based on Foata normal form. 202/1419 useless extension candidates. Maximal degree in co-relation 3927. Up to 717 conditions per place. [2023-01-27 22:22:58,743 INFO L137 encePairwiseOnDemand]: 332/341 looper letters, 76 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2023-01-27 22:22:58,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 538 flow [2023-01-27 22:22:58,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 22:22:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 22:22:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1088 transitions. [2023-01-27 22:22:58,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2023-01-27 22:22:58,747 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1088 transitions. [2023-01-27 22:22:58,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1088 transitions. [2023-01-27 22:22:58,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:22:58,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1088 transitions. [2023-01-27 22:22:58,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:58,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 341.0) internal successors, (3069), 9 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:58,754 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 341.0) internal successors, (3069), 9 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:58,754 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 144 flow. Second operand 8 states and 1088 transitions. [2023-01-27 22:22:58,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 538 flow [2023-01-27 22:22:58,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 88 transitions, 533 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 22:22:58,757 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 208 flow [2023-01-27 22:22:58,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=208, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-01-27 22:22:58,758 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2023-01-27 22:22:58,758 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 208 flow [2023-01-27 22:22:58,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:58,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:22:58,759 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:22:58,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-27 22:22:58,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:22:58,965 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:22:58,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:22:58,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1520372626, now seen corresponding path program 3 times [2023-01-27 22:22:58,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:22:58,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196432596] [2023-01-27 22:22:58,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:22:58,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:22:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:22:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:22:59,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:22:59,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196432596] [2023-01-27 22:22:59,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196432596] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:22:59,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6009878] [2023-01-27 22:22:59,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:22:59,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:22:59,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:22:59,106 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:22:59,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-27 22:22:59,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 22:22:59,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:22:59,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-27 22:22:59,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:22:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:22:59,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:22:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:22:59,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6009878] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 22:22:59,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 22:22:59,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2023-01-27 22:22:59,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708564427] [2023-01-27 22:22:59,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:22:59,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 22:22:59,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:22:59,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 22:22:59,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-01-27 22:22:59,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 341 [2023-01-27 22:22:59,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 208 flow. Second operand has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:59,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:22:59,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 341 [2023-01-27 22:22:59,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:22:59,729 INFO L130 PetriNetUnfolder]: 1354/1861 cut-off events. [2023-01-27 22:22:59,729 INFO L131 PetriNetUnfolder]: For 2964/3192 co-relation queries the response was YES. [2023-01-27 22:22:59,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6699 conditions, 1861 events. 1354/1861 cut-off events. For 2964/3192 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7039 event pairs, 292 based on Foata normal form. 240/2100 useless extension candidates. Maximal degree in co-relation 6667. Up to 877 conditions per place. [2023-01-27 22:22:59,743 INFO L137 encePairwiseOnDemand]: 331/341 looper letters, 98 selfloop transitions, 28 changer transitions 0/127 dead transitions. [2023-01-27 22:22:59,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 127 transitions, 896 flow [2023-01-27 22:22:59,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 22:22:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 22:22:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1362 transitions. [2023-01-27 22:22:59,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3994134897360704 [2023-01-27 22:22:59,748 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1362 transitions. [2023-01-27 22:22:59,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1362 transitions. [2023-01-27 22:22:59,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:22:59,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1362 transitions. [2023-01-27 22:22:59,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 136.2) internal successors, (1362), 10 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:59,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 341.0) internal successors, (3751), 11 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:59,757 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 341.0) internal successors, (3751), 11 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:59,757 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 208 flow. Second operand 10 states and 1362 transitions. [2023-01-27 22:22:59,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 127 transitions, 896 flow [2023-01-27 22:22:59,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 127 transitions, 873 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-27 22:22:59,761 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 383 flow [2023-01-27 22:22:59,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=383, PETRI_PLACES=58, PETRI_TRANSITIONS=58} [2023-01-27 22:22:59,762 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2023-01-27 22:22:59,762 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 58 transitions, 383 flow [2023-01-27 22:22:59,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:22:59,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:22:59,763 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:22:59,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-27 22:22:59,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:22:59,973 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:22:59,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:22:59,973 INFO L85 PathProgramCache]: Analyzing trace with hash -259531838, now seen corresponding path program 4 times [2023-01-27 22:22:59,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:22:59,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311691532] [2023-01-27 22:22:59,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:22:59,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:22:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:23:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:23:00,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:23:00,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311691532] [2023-01-27 22:23:00,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311691532] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:23:00,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191362231] [2023-01-27 22:23:00,109 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:23:00,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:23:00,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:23:00,110 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:23:00,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-27 22:23:00,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:23:00,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:23:00,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-27 22:23:00,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:23:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:23:00,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:23:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:23:00,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191362231] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:23:00,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:23:00,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2023-01-27 22:23:00,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383098719] [2023-01-27 22:23:00,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:23:00,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-27 22:23:00,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:23:00,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-27 22:23:00,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-01-27 22:23:00,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 341 [2023-01-27 22:23:00,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 383 flow. Second operand has 18 states, 18 states have (on average 129.83333333333334) internal successors, (2337), 18 states have internal predecessors, (2337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:00,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:23:00,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 341 [2023-01-27 22:23:00,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:23:00,993 INFO L130 PetriNetUnfolder]: 1773/2440 cut-off events. [2023-01-27 22:23:00,993 INFO L131 PetriNetUnfolder]: For 6600/6898 co-relation queries the response was YES. [2023-01-27 22:23:00,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 2440 events. 1773/2440 cut-off events. For 6600/6898 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9975 event pairs, 316 based on Foata normal form. 312/2751 useless extension candidates. Maximal degree in co-relation 10429. Up to 1135 conditions per place. [2023-01-27 22:23:01,012 INFO L137 encePairwiseOnDemand]: 330/341 looper letters, 110 selfloop transitions, 51 changer transitions 0/162 dead transitions. [2023-01-27 22:23:01,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 162 transitions, 1330 flow [2023-01-27 22:23:01,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 22:23:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 22:23:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1373 transitions. [2023-01-27 22:23:01,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4026392961876833 [2023-01-27 22:23:01,017 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1373 transitions. [2023-01-27 22:23:01,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1373 transitions. [2023-01-27 22:23:01,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:23:01,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1373 transitions. [2023-01-27 22:23:01,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 137.3) internal successors, (1373), 10 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:01,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 341.0) internal successors, (3751), 11 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:01,026 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 341.0) internal successors, (3751), 11 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:01,026 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 383 flow. Second operand 10 states and 1373 transitions. [2023-01-27 22:23:01,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 162 transitions, 1330 flow [2023-01-27 22:23:01,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 162 transitions, 1269 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-01-27 22:23:01,049 INFO L231 Difference]: Finished difference. Result has 69 places, 90 transitions, 794 flow [2023-01-27 22:23:01,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=794, PETRI_PLACES=69, PETRI_TRANSITIONS=90} [2023-01-27 22:23:01,049 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 37 predicate places. [2023-01-27 22:23:01,049 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 90 transitions, 794 flow [2023-01-27 22:23:01,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 129.83333333333334) internal successors, (2337), 18 states have internal predecessors, (2337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:01,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:23:01,051 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:23:01,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-27 22:23:01,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:23:01,256 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:23:01,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:23:01,257 INFO L85 PathProgramCache]: Analyzing trace with hash 111750626, now seen corresponding path program 5 times [2023-01-27 22:23:01,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:23:01,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273307237] [2023-01-27 22:23:01,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:23:01,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:23:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:23:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:23:01,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:23:01,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273307237] [2023-01-27 22:23:01,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273307237] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:23:01,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288005650] [2023-01-27 22:23:01,389 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 22:23:01,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:23:01,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:23:01,391 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:23:01,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-27 22:23:01,495 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:23:01,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:23:01,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-27 22:23:01,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:23:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:23:01,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:23:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:23:01,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288005650] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:23:01,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:23:01,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2023-01-27 22:23:01,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684983866] [2023-01-27 22:23:01,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:23:01,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-27 22:23:01,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:23:01,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-27 22:23:01,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-01-27 22:23:01,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 341 [2023-01-27 22:23:01,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 90 transitions, 794 flow. Second operand has 15 states, 15 states have (on average 124.86666666666666) internal successors, (1873), 15 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:01,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:23:01,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 341 [2023-01-27 22:23:01,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:23:02,493 INFO L130 PetriNetUnfolder]: 2124/2936 cut-off events. [2023-01-27 22:23:02,493 INFO L131 PetriNetUnfolder]: For 11245/11245 co-relation queries the response was YES. [2023-01-27 22:23:02,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14382 conditions, 2936 events. 2124/2936 cut-off events. For 11245/11245 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11868 event pairs, 72 based on Foata normal form. 16/2952 useless extension candidates. Maximal degree in co-relation 14340. Up to 1249 conditions per place. [2023-01-27 22:23:02,517 INFO L137 encePairwiseOnDemand]: 329/341 looper letters, 144 selfloop transitions, 105 changer transitions 0/249 dead transitions. [2023-01-27 22:23:02,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 249 transitions, 2475 flow [2023-01-27 22:23:02,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-01-27 22:23:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-01-27 22:23:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2095 transitions. [2023-01-27 22:23:02,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3839809384164223 [2023-01-27 22:23:02,523 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2095 transitions. [2023-01-27 22:23:02,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2095 transitions. [2023-01-27 22:23:02,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:23:02,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2095 transitions. [2023-01-27 22:23:02,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 130.9375) internal successors, (2095), 16 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:02,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 341.0) internal successors, (5797), 17 states have internal predecessors, (5797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:02,549 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 341.0) internal successors, (5797), 17 states have internal predecessors, (5797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:02,549 INFO L175 Difference]: Start difference. First operand has 69 places, 90 transitions, 794 flow. Second operand 16 states and 2095 transitions. [2023-01-27 22:23:02,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 249 transitions, 2475 flow [2023-01-27 22:23:02,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 249 transitions, 2432 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-01-27 22:23:02,587 INFO L231 Difference]: Finished difference. Result has 89 places, 149 transitions, 1706 flow [2023-01-27 22:23:02,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1706, PETRI_PLACES=89, PETRI_TRANSITIONS=149} [2023-01-27 22:23:02,589 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 57 predicate places. [2023-01-27 22:23:02,589 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 149 transitions, 1706 flow [2023-01-27 22:23:02,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 124.86666666666666) internal successors, (1873), 15 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:02,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:23:02,589 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:23:02,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-27 22:23:02,795 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,SelfDestructingSolverStorable9 [2023-01-27 22:23:02,795 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:23:02,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:23:02,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2132688008, now seen corresponding path program 6 times [2023-01-27 22:23:02,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:23:02,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800393008] [2023-01-27 22:23:02,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:23:02,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:23:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:23:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:23:02,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:23:02,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800393008] [2023-01-27 22:23:02,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800393008] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:23:02,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766442729] [2023-01-27 22:23:02,961 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 22:23:02,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:23:02,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:23:02,962 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:23:02,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-27 22:23:03,090 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-27 22:23:03,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:23:03,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-27 22:23:03,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:23:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:23:03,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:23:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:23:03,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766442729] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 22:23:03,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 22:23:03,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2023-01-27 22:23:03,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47789333] [2023-01-27 22:23:03,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:23:03,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 22:23:03,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:23:03,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 22:23:03,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-01-27 22:23:03,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 341 [2023-01-27 22:23:03,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 149 transitions, 1706 flow. Second operand has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:03,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:23:03,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 341 [2023-01-27 22:23:03,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:23:03,771 INFO L130 PetriNetUnfolder]: 2056/2828 cut-off events. [2023-01-27 22:23:03,772 INFO L131 PetriNetUnfolder]: For 13548/13666 co-relation queries the response was YES. [2023-01-27 22:23:03,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15149 conditions, 2828 events. 2056/2828 cut-off events. For 13548/13666 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11377 event pairs, 270 based on Foata normal form. 132/2960 useless extension candidates. Maximal degree in co-relation 15098. Up to 1119 conditions per place. [2023-01-27 22:23:03,798 INFO L137 encePairwiseOnDemand]: 331/341 looper letters, 130 selfloop transitions, 71 changer transitions 0/207 dead transitions. [2023-01-27 22:23:03,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 207 transitions, 2433 flow [2023-01-27 22:23:03,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 22:23:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 22:23:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1233 transitions. [2023-01-27 22:23:03,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40175953079178883 [2023-01-27 22:23:03,802 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1233 transitions. [2023-01-27 22:23:03,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1233 transitions. [2023-01-27 22:23:03,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:23:03,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1233 transitions. [2023-01-27 22:23:03,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:03,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:03,809 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:03,809 INFO L175 Difference]: Start difference. First operand has 89 places, 149 transitions, 1706 flow. Second operand 9 states and 1233 transitions. [2023-01-27 22:23:03,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 207 transitions, 2433 flow [2023-01-27 22:23:03,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 207 transitions, 2400 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-01-27 22:23:03,857 INFO L231 Difference]: Finished difference. Result has 96 places, 151 transitions, 1893 flow [2023-01-27 22:23:03,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1893, PETRI_PLACES=96, PETRI_TRANSITIONS=151} [2023-01-27 22:23:03,858 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 64 predicate places. [2023-01-27 22:23:03,858 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 151 transitions, 1893 flow [2023-01-27 22:23:03,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:03,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:23:03,858 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:23:03,864 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-27 22:23:04,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:23:04,064 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:23:04,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:23:04,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1095595526, now seen corresponding path program 7 times [2023-01-27 22:23:04,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:23:04,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415220327] [2023-01-27 22:23:04,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:23:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:23:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:23:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:23:04,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:23:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415220327] [2023-01-27 22:23:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415220327] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:23:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348411396] [2023-01-27 22:23:04,206 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 22:23:04,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:23:04,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:23:04,207 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:23:04,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-27 22:23:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:23:04,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-27 22:23:04,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:23:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:23:04,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:23:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:23:04,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348411396] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 22:23:04,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 22:23:04,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2023-01-27 22:23:04,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109460639] [2023-01-27 22:23:04,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:23:04,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 22:23:04,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:23:04,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 22:23:04,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-01-27 22:23:04,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 341 [2023-01-27 22:23:04,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 151 transitions, 1893 flow. Second operand has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:04,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:23:04,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 341 [2023-01-27 22:23:04,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:23:04,989 INFO L130 PetriNetUnfolder]: 2020/2772 cut-off events. [2023-01-27 22:23:04,989 INFO L131 PetriNetUnfolder]: For 16622/16734 co-relation queries the response was YES. [2023-01-27 22:23:05,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15837 conditions, 2772 events. 2020/2772 cut-off events. For 16622/16734 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10995 event pairs, 302 based on Foata normal form. 126/2898 useless extension candidates. Maximal degree in co-relation 15783. Up to 1096 conditions per place. [2023-01-27 22:23:05,012 INFO L137 encePairwiseOnDemand]: 331/341 looper letters, 95 selfloop transitions, 102 changer transitions 0/203 dead transitions. [2023-01-27 22:23:05,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 203 transitions, 2568 flow [2023-01-27 22:23:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 22:23:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 22:23:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1228 transitions. [2023-01-27 22:23:05,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4001303356142066 [2023-01-27 22:23:05,016 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1228 transitions. [2023-01-27 22:23:05,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1228 transitions. [2023-01-27 22:23:05,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:23:05,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1228 transitions. [2023-01-27 22:23:05,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 136.44444444444446) internal successors, (1228), 9 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:05,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:05,022 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:05,022 INFO L175 Difference]: Start difference. First operand has 96 places, 151 transitions, 1893 flow. Second operand 9 states and 1228 transitions. [2023-01-27 22:23:05,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 203 transitions, 2568 flow [2023-01-27 22:23:05,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 203 transitions, 2553 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-01-27 22:23:05,077 INFO L231 Difference]: Finished difference. Result has 103 places, 153 transitions, 2192 flow [2023-01-27 22:23:05,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2192, PETRI_PLACES=103, PETRI_TRANSITIONS=153} [2023-01-27 22:23:05,078 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 71 predicate places. [2023-01-27 22:23:05,078 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 153 transitions, 2192 flow [2023-01-27 22:23:05,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:05,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:23:05,078 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:23:05,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-27 22:23:05,284 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,SelfDestructingSolverStorable11 [2023-01-27 22:23:05,285 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:23:05,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:23:05,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1081782259, now seen corresponding path program 1 times [2023-01-27 22:23:05,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:23:05,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983891720] [2023-01-27 22:23:05,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:23:05,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:23:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:23:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:23:05,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:23:05,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983891720] [2023-01-27 22:23:05,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983891720] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:23:05,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:23:05,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 22:23:05,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752452296] [2023-01-27 22:23:05,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:23:05,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 22:23:05,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:23:05,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 22:23:05,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 22:23:05,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-01-27 22:23:05,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 153 transitions, 2192 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:05,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:23:05,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-01-27 22:23:05,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:23:05,657 INFO L130 PetriNetUnfolder]: 1876/2602 cut-off events. [2023-01-27 22:23:05,657 INFO L131 PetriNetUnfolder]: For 25072/25806 co-relation queries the response was YES. [2023-01-27 22:23:05,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16315 conditions, 2602 events. 1876/2602 cut-off events. For 25072/25806 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 11346 event pairs, 464 based on Foata normal form. 436/2943 useless extension candidates. Maximal degree in co-relation 16258. Up to 1644 conditions per place. [2023-01-27 22:23:05,721 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 166 selfloop transitions, 3 changer transitions 0/194 dead transitions. [2023-01-27 22:23:05,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 194 transitions, 3059 flow [2023-01-27 22:23:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 22:23:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 22:23:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2023-01-27 22:23:05,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49266862170087977 [2023-01-27 22:23:05,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2023-01-27 22:23:05,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2023-01-27 22:23:05,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:23:05,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2023-01-27 22:23:05,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:05,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:05,726 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:05,726 INFO L175 Difference]: Start difference. First operand has 103 places, 153 transitions, 2192 flow. Second operand 3 states and 504 transitions. [2023-01-27 22:23:05,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 194 transitions, 3059 flow [2023-01-27 22:23:05,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 194 transitions, 2924 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-01-27 22:23:05,763 INFO L231 Difference]: Finished difference. Result has 100 places, 153 transitions, 2093 flow [2023-01-27 22:23:05,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2075, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2093, PETRI_PLACES=100, PETRI_TRANSITIONS=153} [2023-01-27 22:23:05,764 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 68 predicate places. [2023-01-27 22:23:05,764 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 153 transitions, 2093 flow [2023-01-27 22:23:05,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:05,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:23:05,764 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:23:05,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 22:23:05,765 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:23:05,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:23:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2072266448, now seen corresponding path program 1 times [2023-01-27 22:23:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:23:05,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770940410] [2023-01-27 22:23:05,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:23:05,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:23:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:23:08,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:23:08,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:23:08,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770940410] [2023-01-27 22:23:08,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770940410] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:23:08,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79459403] [2023-01-27 22:23:08,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:23:08,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:23:08,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:23:08,916 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:23:08,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-27 22:23:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:23:09,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 51 conjunts are in the unsatisfiable core [2023-01-27 22:23:09,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:23:09,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 22:23:09,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 22:23:09,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:23:09,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-27 22:23:09,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:23:09,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-27 22:23:10,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:23:10,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:23:10,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 52 [2023-01-27 22:23:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:23:10,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:23:11,563 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~A~0.offset 4 (* c_thread1Thread1of1ForFork0_~i~0 4))) (.cse10 (* 4 c_~M~0))) (let ((.cse1 (= (mod c_~sorted3~0 256) 0)) (.cse2 (<= c_~N~0 (+ c_~M~0 1))) (.cse3 (< (+ 2 c_~M~0) c_~N~0)) (.cse8 (+ c_~A~0.offset .cse10)) (.cse7 (+ c_~A~0.offset .cse10 4)) (.cse4 (= (mod c_~sorted2~0 256) 0)) (.cse0 (forall ((v_ArrVal_587 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base) .cse6) |c_thread1Thread1of1ForFork0_#t~mem2|)))) (and (or .cse0 (not .cse1) .cse2 .cse3) (or .cse1 .cse2 .cse3 .cse4 (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (or (< |c_thread1Thread1of1ForFork0_#t~mem2| (select .cse5 .cse6)) (<= (select .cse5 .cse7) (select .cse5 .cse8)))))) (or .cse2 .cse3 (and (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (or (<= (select .cse9 .cse6) |c_thread1Thread1of1ForFork0_#t~mem2|) (< (select .cse9 .cse8) (select .cse9 .cse7))))) (or (not .cse4) .cse0)))))) is different from false [2023-01-27 22:23:23,593 WARN L222 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:23:23,746 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((~M~0 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_585))) (let ((.cse0 (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 ~M~0) (let ((.cse1 (* ~M~0 4))) (< (select .cse0 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse0 (+ .cse1 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (+ 2 ~M~0) c_~N~0) (<= (select .cse0 .cse2) (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= c_~N~0 (+ ~M~0 1)))))) (forall ((~M~0 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_585))) (let ((.cse5 (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 ~M~0) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse5 .cse2)) (< (+ 2 ~M~0) c_~N~0) (let ((.cse6 (* ~M~0 4))) (<= (select .cse5 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse5 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (<= c_~N~0 (+ ~M~0 1)))))))) is different from false [2023-01-27 22:23:23,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:23:23,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 76 [2023-01-27 22:23:23,834 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-01-27 22:23:23,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 515 treesize of output 480 [2023-01-27 22:23:23,879 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-01-27 22:23:23,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 314 treesize of output 254 [2023-01-27 22:23:23,903 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-01-27 22:23:23,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 220 [2023-01-27 22:23:23,945 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-01-27 22:23:23,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 119 [2023-01-27 22:23:24,469 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:23:24,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 1 [2023-01-27 22:23:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-01-27 22:23:24,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79459403] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:23:24,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:23:24,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 41 [2023-01-27 22:23:24,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113835403] [2023-01-27 22:23:24,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:23:24,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-01-27 22:23:24,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:23:24,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-01-27 22:23:24,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1465, Unknown=12, NotChecked=158, Total=1806 [2023-01-27 22:23:24,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 341 [2023-01-27 22:23:24,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 153 transitions, 2093 flow. Second operand has 43 states, 43 states have (on average 86.74418604651163) internal successors, (3730), 43 states have internal predecessors, (3730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:23:24,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:23:24,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 341 [2023-01-27 22:23:24,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:23:35,496 WARN L222 SmtUtils]: Spent 8.84s on a formula simplification. DAG size of input: 123 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:24:02,788 WARN L222 SmtUtils]: Spent 25.77s on a formula simplification. DAG size of input: 136 DAG size of output: 105 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:24:30,955 WARN L222 SmtUtils]: Spent 25.01s on a formula simplification. DAG size of input: 101 DAG size of output: 89 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:24:39,983 WARN L222 SmtUtils]: Spent 8.77s on a formula simplification. DAG size of input: 143 DAG size of output: 111 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:25:19,268 WARN L222 SmtUtils]: Spent 32.89s on a formula simplification. DAG size of input: 112 DAG size of output: 100 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:26:14,284 WARN L222 SmtUtils]: Spent 33.17s on a formula simplification. DAG size of input: 127 DAG size of output: 115 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:26:28,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:27:02,438 WARN L222 SmtUtils]: Spent 33.62s on a formula simplification. DAG size of input: 138 DAG size of output: 126 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:27:04,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:27:27,648 WARN L222 SmtUtils]: Spent 17.30s on a formula simplification. DAG size of input: 117 DAG size of output: 100 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:28:06,936 WARN L222 SmtUtils]: Spent 33.90s on a formula simplification. DAG size of input: 130 DAG size of output: 118 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:28:35,286 WARN L222 SmtUtils]: Spent 11.32s on a formula simplification. DAG size of input: 128 DAG size of output: 110 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:29:15,016 WARN L222 SmtUtils]: Spent 37.49s on a formula simplification. DAG size of input: 141 DAG size of output: 129 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:29:17,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:29:26,971 WARN L222 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 139 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:29:47,498 WARN L222 SmtUtils]: Spent 12.64s on a formula simplification. DAG size of input: 170 DAG size of output: 136 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:30:08,117 WARN L222 SmtUtils]: Spent 20.34s on a formula simplification. DAG size of input: 161 DAG size of output: 131 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:30:21,190 WARN L222 SmtUtils]: Spent 6.85s on a formula simplification. DAG size of input: 192 DAG size of output: 100 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:30:23,559 INFO L130 PetriNetUnfolder]: 6133/8833 cut-off events. [2023-01-27 22:30:23,559 INFO L131 PetriNetUnfolder]: For 70049/70049 co-relation queries the response was YES. [2023-01-27 22:30:23,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51119 conditions, 8833 events. 6133/8833 cut-off events. For 70049/70049 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 46620 event pairs, 121 based on Foata normal form. 7/8840 useless extension candidates. Maximal degree in co-relation 51063. Up to 3586 conditions per place. [2023-01-27 22:30:23,619 INFO L137 encePairwiseOnDemand]: 323/341 looper letters, 609 selfloop transitions, 505 changer transitions 42/1156 dead transitions. [2023-01-27 22:30:23,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 1156 transitions, 14436 flow [2023-01-27 22:30:23,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-01-27 22:30:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2023-01-27 22:30:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 7570 transitions. [2023-01-27 22:30:23,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2740668332066182 [2023-01-27 22:30:23,632 INFO L72 ComplementDD]: Start complementDD. Operand 81 states and 7570 transitions. [2023-01-27 22:30:23,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 7570 transitions. [2023-01-27 22:30:23,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:30:23,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 81 states and 7570 transitions. [2023-01-27 22:30:23,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 82 states, 81 states have (on average 93.45679012345678) internal successors, (7570), 81 states have internal predecessors, (7570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:30:23,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 82 states, 82 states have (on average 341.0) internal successors, (27962), 82 states have internal predecessors, (27962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:30:23,677 INFO L81 ComplementDD]: Finished complementDD. Result has 82 states, 82 states have (on average 341.0) internal successors, (27962), 82 states have internal predecessors, (27962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:30:23,677 INFO L175 Difference]: Start difference. First operand has 100 places, 153 transitions, 2093 flow. Second operand 81 states and 7570 transitions. [2023-01-27 22:30:23,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 1156 transitions, 14436 flow [2023-01-27 22:30:23,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 1156 transitions, 14427 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 22:30:23,902 INFO L231 Difference]: Finished difference. Result has 204 places, 646 transitions, 10231 flow [2023-01-27 22:30:23,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=81, PETRI_FLOW=10231, PETRI_PLACES=204, PETRI_TRANSITIONS=646} [2023-01-27 22:30:23,903 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 172 predicate places. [2023-01-27 22:30:23,903 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 646 transitions, 10231 flow [2023-01-27 22:30:23,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 86.74418604651163) internal successors, (3730), 43 states have internal predecessors, (3730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:30:23,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:30:23,904 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:30:23,910 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-27 22:30:24,110 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,SelfDestructingSolverStorable13 [2023-01-27 22:30:24,110 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:30:24,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:30:24,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1236109612, now seen corresponding path program 2 times [2023-01-27 22:30:24,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:30:24,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209325199] [2023-01-27 22:30:24,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:30:24,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:30:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:30:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:30:26,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:30:26,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209325199] [2023-01-27 22:30:26,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209325199] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:30:26,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995022164] [2023-01-27 22:30:26,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:30:26,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:30:26,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:30:26,505 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:30:26,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-27 22:30:26,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:30:26,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:30:26,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-27 22:30:26,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:30:27,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:30:27,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:30:27,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 52 [2023-01-27 22:30:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:30:27,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:30:28,995 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:30:28,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 79 [2023-01-27 22:30:29,113 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-01-27 22:30:29,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 1 [2023-01-27 22:30:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:30:29,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995022164] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:30:29,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:30:29,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2023-01-27 22:30:29,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614603652] [2023-01-27 22:30:29,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:30:29,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-27 22:30:29,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:30:29,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-27 22:30:29,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2023-01-27 22:30:29,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 341 [2023-01-27 22:30:29,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 646 transitions, 10231 flow. Second operand has 38 states, 38 states have (on average 96.97368421052632) internal successors, (3685), 38 states have internal predecessors, (3685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:30:29,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:30:29,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 341 [2023-01-27 22:30:29,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:30:56,877 INFO L130 PetriNetUnfolder]: 12320/17724 cut-off events. [2023-01-27 22:30:56,877 INFO L131 PetriNetUnfolder]: For 180393/180393 co-relation queries the response was YES. [2023-01-27 22:30:57,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117498 conditions, 17724 events. 12320/17724 cut-off events. For 180393/180393 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 102300 event pairs, 154 based on Foata normal form. 386/18110 useless extension candidates. Maximal degree in co-relation 117413. Up to 6989 conditions per place. [2023-01-27 22:30:57,141 INFO L137 encePairwiseOnDemand]: 322/341 looper letters, 823 selfloop transitions, 1275 changer transitions 51/2149 dead transitions. [2023-01-27 22:30:57,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 2149 transitions, 31039 flow [2023-01-27 22:30:57,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-01-27 22:30:57,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2023-01-27 22:30:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 10792 transitions. [2023-01-27 22:30:57,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3102754298200219 [2023-01-27 22:30:57,163 INFO L72 ComplementDD]: Start complementDD. Operand 102 states and 10792 transitions. [2023-01-27 22:30:57,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 10792 transitions. [2023-01-27 22:30:57,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:30:57,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 102 states and 10792 transitions. [2023-01-27 22:30:57,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 103 states, 102 states have (on average 105.80392156862744) internal successors, (10792), 102 states have internal predecessors, (10792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:30:57,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 103 states, 103 states have (on average 341.0) internal successors, (35123), 103 states have internal predecessors, (35123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:30:57,231 INFO L81 ComplementDD]: Finished complementDD. Result has 103 states, 103 states have (on average 341.0) internal successors, (35123), 103 states have internal predecessors, (35123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:30:57,231 INFO L175 Difference]: Start difference. First operand has 204 places, 646 transitions, 10231 flow. Second operand 102 states and 10792 transitions. [2023-01-27 22:30:57,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 2149 transitions, 31039 flow [2023-01-27 22:30:58,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 2149 transitions, 28973 flow, removed 980 selfloop flow, removed 4 redundant places. [2023-01-27 22:30:58,048 INFO L231 Difference]: Finished difference. Result has 356 places, 1489 transitions, 24596 flow [2023-01-27 22:30:58,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=8018, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=449, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=102, PETRI_FLOW=24596, PETRI_PLACES=356, PETRI_TRANSITIONS=1489} [2023-01-27 22:30:58,049 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 324 predicate places. [2023-01-27 22:30:58,049 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 1489 transitions, 24596 flow [2023-01-27 22:30:58,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 96.97368421052632) internal successors, (3685), 38 states have internal predecessors, (3685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:30:58,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:30:58,050 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:30:58,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-27 22:30:58,255 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,SelfDestructingSolverStorable14 [2023-01-27 22:30:58,255 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:30:58,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:30:58,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1304888468, now seen corresponding path program 3 times [2023-01-27 22:30:58,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:30:58,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025854013] [2023-01-27 22:30:58,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:30:58,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:30:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:31:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:31:00,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:31:00,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025854013] [2023-01-27 22:31:00,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025854013] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:31:00,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416794102] [2023-01-27 22:31:00,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:31:00,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:31:00,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:31:00,522 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:31:00,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-27 22:31:00,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 22:31:00,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:31:00,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 50 conjunts are in the unsatisfiable core [2023-01-27 22:31:00,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:31:00,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 22:31:00,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 22:31:00,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 22:31:01,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:31:01,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-27 22:31:01,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:31:01,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:31:01,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 52 [2023-01-27 22:31:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:31:01,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:31:06,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:31:06,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 79 [2023-01-27 22:31:06,343 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-01-27 22:31:06,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 823 treesize of output 776 [2023-01-27 22:31:06,380 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-01-27 22:31:06,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 318 treesize of output 258 [2023-01-27 22:31:06,425 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-01-27 22:31:06,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 250 treesize of output 234 [2023-01-27 22:31:06,471 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-01-27 22:31:06,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 119 [2023-01-27 22:31:07,164 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:31:07,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 1 [2023-01-27 22:31:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:31:07,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416794102] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:31:07,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:31:07,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 38 [2023-01-27 22:31:07,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540134226] [2023-01-27 22:31:07,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:31:07,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-01-27 22:31:07,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:31:07,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-01-27 22:31:07,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1373, Unknown=23, NotChecked=0, Total=1560 [2023-01-27 22:31:07,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 341 [2023-01-27 22:31:07,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 1489 transitions, 24596 flow. Second operand has 40 states, 40 states have (on average 86.825) internal successors, (3473), 40 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:31:07,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:31:07,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 341 [2023-01-27 22:31:07,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:31:34,563 WARN L222 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 146 DAG size of output: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:31:40,894 WARN L222 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 78 DAG size of output: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:31:47,727 WARN L222 SmtUtils]: Spent 6.64s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:31:56,942 WARN L222 SmtUtils]: Spent 8.91s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:32:14,944 WARN L222 SmtUtils]: Spent 13.34s on a formula simplification that was a NOOP. DAG size: 130 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:32:54,707 WARN L222 SmtUtils]: Spent 21.85s on a formula simplification. DAG size of input: 124 DAG size of output: 121 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:33:11,907 WARN L222 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 117 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:33:28,576 WARN L222 SmtUtils]: Spent 15.08s on a formula simplification. DAG size of input: 140 DAG size of output: 124 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:33:47,784 WARN L222 SmtUtils]: Spent 18.53s on a formula simplification. DAG size of input: 137 DAG size of output: 134 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:33:56,313 WARN L222 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 150 DAG size of output: 103 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:33:58,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:34:00,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:34:08,686 WARN L222 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 110 DAG size of output: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:34:26,166 WARN L222 SmtUtils]: Spent 16.46s on a formula simplification. DAG size of input: 211 DAG size of output: 134 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:34:28,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:34:30,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:34:48,064 WARN L222 SmtUtils]: Spent 17.28s on a formula simplification. DAG size of input: 153 DAG size of output: 134 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:35:07,129 WARN L222 SmtUtils]: Spent 16.73s on a formula simplification. DAG size of input: 155 DAG size of output: 152 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:35:13,744 WARN L222 SmtUtils]: Spent 5.49s on a formula simplification. DAG size of input: 135 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:35:23,454 WARN L222 SmtUtils]: Spent 6.58s on a formula simplification. DAG size of input: 144 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:35:42,458 WARN L222 SmtUtils]: Spent 9.10s on a formula simplification that was a NOOP. DAG size: 148 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:35:56,821 WARN L222 SmtUtils]: Spent 7.58s on a formula simplification. DAG size of input: 224 DAG size of output: 146 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:36:16,742 WARN L222 SmtUtils]: Spent 16.47s on a formula simplification. DAG size of input: 168 DAG size of output: 165 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:36:27,910 WARN L222 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 162 DAG size of output: 133 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-01-27 22:36:53,293 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 22:36:53,293 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-27 22:36:54,301 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-27 22:36:54,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2023-01-27 22:36:54,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-27 22:36:54,436 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:236) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:483) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-01-27 22:36:54,440 INFO L158 Benchmark]: Toolchain (without parser) took 848103.32ms. Allocated memory was 379.6MB in the beginning and 960.5MB in the end (delta: 580.9MB). Free memory was 339.1MB in the beginning and 232.3MB in the end (delta: 106.8MB). Peak memory consumption was 689.1MB. Max. memory is 16.0GB. [2023-01-27 22:36:54,440 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 22:36:54,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.69ms. Allocated memory is still 379.6MB. Free memory was 338.8MB in the beginning and 327.4MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-27 22:36:54,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.80ms. Allocated memory is still 379.6MB. Free memory was 327.4MB in the beginning and 325.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 22:36:54,440 INFO L158 Benchmark]: Boogie Preprocessor took 40.46ms. Allocated memory is still 379.6MB. Free memory was 325.6MB in the beginning and 323.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 22:36:54,441 INFO L158 Benchmark]: RCFGBuilder took 407.02ms. Allocated memory is still 379.6MB. Free memory was 323.8MB in the beginning and 306.1MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-01-27 22:36:54,441 INFO L158 Benchmark]: TraceAbstraction took 847324.80ms. Allocated memory was 379.6MB in the beginning and 960.5MB in the end (delta: 580.9MB). Free memory was 305.2MB in the beginning and 232.3MB in the end (delta: 72.9MB). Peak memory consumption was 655.5MB. Max. memory is 16.0GB. [2023-01-27 22:36:54,442 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 276.69ms. Allocated memory is still 379.6MB. Free memory was 338.8MB in the beginning and 327.4MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 47.80ms. Allocated memory is still 379.6MB. Free memory was 327.4MB in the beginning and 325.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.46ms. Allocated memory is still 379.6MB. Free memory was 325.6MB in the beginning and 323.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 407.02ms. Allocated memory is still 379.6MB. Free memory was 323.8MB in the beginning and 306.1MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 847324.80ms. Allocated memory was 379.6MB in the beginning and 960.5MB in the end (delta: 580.9MB). Free memory was 305.2MB in the beginning and 232.3MB in the end (delta: 72.9MB). Peak memory consumption was 655.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 157 PlacesBefore, 32 PlacesAfterwards, 162 TransitionsBefore, 28 TransitionsAfterwards, 3534 CoEnabledTransitionPairs, 7 FixpointIterations, 75 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 22 ConcurrentYvCompositions, 9 ChoiceCompositions, 166 TotalNumberOfCompositions, 4092 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3679, independent: 3638, independent conditional: 0, independent unconditional: 3638, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2053, independent: 2038, independent conditional: 0, independent unconditional: 2038, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3679, independent: 1600, independent conditional: 0, independent unconditional: 1600, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 2053, unknown conditional: 0, unknown unconditional: 2053] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown