/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 11:27:16,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 11:27:16,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 11:27:16,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 11:27:16,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 11:27:16,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 11:27:16,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 11:27:16,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 11:27:16,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 11:27:16,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 11:27:16,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 11:27:16,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 11:27:16,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 11:27:16,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 11:27:16,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 11:27:16,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 11:27:16,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 11:27:16,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 11:27:16,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 11:27:16,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 11:27:16,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 11:27:16,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 11:27:16,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 11:27:16,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 11:27:16,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 11:27:16,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 11:27:16,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 11:27:16,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 11:27:16,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 11:27:16,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 11:27:16,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 11:27:16,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 11:27:16,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 11:27:16,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 11:27:16,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 11:27:16,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 11:27:16,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 11:27:16,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 11:27:16,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 11:27:16,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 11:27:16,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 11:27:16,657 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 11:27:16,679 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 11:27:16,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 11:27:16,679 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 11:27:16,679 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 11:27:16,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 11:27:16,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 11:27:16,680 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 11:27:16,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 11:27:16,680 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 11:27:16,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 11:27:16,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 11:27:16,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 11:27:16,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 11:27:16,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 11:27:16,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 11:27:16,683 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 11:27:16,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 11:27:16,684 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 11:27:16,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 11:27:16,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 11:27:16,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 11:27:16,684 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 11:27:16,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 11:27:16,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 11:27:16,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 11:27:16,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 11:27:16,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 11:27:16,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 11:27:16,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 11:27:16,685 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 11:27:16,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 11:27:16,685 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 11:27:16,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 11:27:16,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 11:27:16,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 11:27:16,880 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 11:27:16,881 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 11:27:16,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2023-01-28 11:27:17,713 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 11:27:17,899 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 11:27:17,900 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2023-01-28 11:27:17,904 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd51592ad/b089d78a3ec44572ae54f4b102e67343/FLAG3a9af9dc2 [2023-01-28 11:27:17,912 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd51592ad/b089d78a3ec44572ae54f4b102e67343 [2023-01-28 11:27:17,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 11:27:17,914 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 11:27:17,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 11:27:17,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 11:27:17,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 11:27:17,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:27:17" (1/1) ... [2023-01-28 11:27:17,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408edc01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:27:17, skipping insertion in model container [2023-01-28 11:27:17,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:27:17" (1/1) ... [2023-01-28 11:27:17,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 11:27:17,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 11:27:18,027 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-prod-cons.wvr.c[3056,3069] [2023-01-28 11:27:18,033 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 11:27:18,038 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 11:27:18,054 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-prod-cons.wvr.c[3056,3069] [2023-01-28 11:27:18,056 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 11:27:18,060 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 11:27:18,061 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 11:27:18,064 INFO L208 MainTranslator]: Completed translation [2023-01-28 11:27:18,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:27:18 WrapperNode [2023-01-28 11:27:18,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 11:27:18,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 11:27:18,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 11:27:18,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 11:27:18,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:27:18" (1/1) ... [2023-01-28 11:27:18,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:27:18" (1/1) ... [2023-01-28 11:27:18,088 INFO L138 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 170 [2023-01-28 11:27:18,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 11:27:18,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 11:27:18,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 11:27:18,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 11:27:18,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:27:18" (1/1) ... [2023-01-28 11:27:18,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:27:18" (1/1) ... [2023-01-28 11:27:18,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:27:18" (1/1) ... [2023-01-28 11:27:18,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:27:18" (1/1) ... [2023-01-28 11:27:18,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:27:18" (1/1) ... [2023-01-28 11:27:18,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:27:18" (1/1) ... [2023-01-28 11:27:18,109 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:27:18" (1/1) ... [2023-01-28 11:27:18,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:27:18" (1/1) ... [2023-01-28 11:27:18,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 11:27:18,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 11:27:18,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 11:27:18,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 11:27:18,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:27:18" (1/1) ... [2023-01-28 11:27:18,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 11:27:18,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:27:18,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 11:27:18,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 11:27:18,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 11:27:18,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 11:27:18,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 11:27:18,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 11:27:18,165 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 11:27:18,165 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 11:27:18,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 11:27:18,167 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 11:27:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 11:27:18,167 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 11:27:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 11:27:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 11:27:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 11:27:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 11:27:18,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 11:27:18,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 11:27:18,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 11:27:18,169 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 11:27:18,257 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 11:27:18,258 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 11:27:18,505 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 11:27:18,547 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 11:27:18,547 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-28 11:27:18,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:27:18 BoogieIcfgContainer [2023-01-28 11:27:18,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 11:27:18,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 11:27:18,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 11:27:18,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 11:27:18,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:27:17" (1/3) ... [2023-01-28 11:27:18,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed3987c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:27:18, skipping insertion in model container [2023-01-28 11:27:18,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:27:18" (2/3) ... [2023-01-28 11:27:18,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed3987c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:27:18, skipping insertion in model container [2023-01-28 11:27:18,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:27:18" (3/3) ... [2023-01-28 11:27:18,554 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2023-01-28 11:27:18,564 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 11:27:18,564 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 11:27:18,564 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 11:27:18,610 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-28 11:27:18,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 148 transitions, 320 flow [2023-01-28 11:27:18,680 INFO L130 PetriNetUnfolder]: 11/145 cut-off events. [2023-01-28 11:27:18,680 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 11:27:18,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 11/145 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 84 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 116. Up to 3 conditions per place. [2023-01-28 11:27:18,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 148 transitions, 320 flow [2023-01-28 11:27:18,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 135 transitions, 288 flow [2023-01-28 11:27:18,689 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 11:27:18,694 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 135 transitions, 288 flow [2023-01-28 11:27:18,695 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 135 transitions, 288 flow [2023-01-28 11:27:18,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 135 transitions, 288 flow [2023-01-28 11:27:18,718 INFO L130 PetriNetUnfolder]: 11/135 cut-off events. [2023-01-28 11:27:18,718 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 11:27:18,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 11/135 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 116. Up to 3 conditions per place. [2023-01-28 11:27:18,720 INFO L119 LiptonReduction]: Number of co-enabled transitions 1082 [2023-01-28 11:27:22,509 INFO L134 LiptonReduction]: Checked pairs total: 2030 [2023-01-28 11:27:22,510 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-01-28 11:27:22,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 11:27:22,522 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;@5927a767, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 11:27:22,523 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 11:27:22,527 INFO L130 PetriNetUnfolder]: 3/24 cut-off events. [2023-01-28 11:27:22,527 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 11:27:22,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:27:22,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:27:22,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:27:22,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:27:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1050761945, now seen corresponding path program 1 times [2023-01-28 11:27:22,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:27:22,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554412257] [2023-01-28 11:27:22,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:27:22,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:27:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:27:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:27:22,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:27:22,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554412257] [2023-01-28 11:27:22,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554412257] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:27:22,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:27:22,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 11:27:22,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526588098] [2023-01-28 11:27:22,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:27:22,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 11:27:22,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:27:22,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 11:27:22,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 11:27:22,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-01-28 11:27:22,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:22,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:27:22,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-01-28 11:27:22,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:27:23,006 INFO L130 PetriNetUnfolder]: 238/394 cut-off events. [2023-01-28 11:27:23,007 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-01-28 11:27:23,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 394 events. 238/394 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1530 event pairs, 14 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 687. Up to 129 conditions per place. [2023-01-28 11:27:23,013 INFO L137 encePairwiseOnDemand]: 278/283 looper letters, 44 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-01-28 11:27:23,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 230 flow [2023-01-28 11:27:23,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 11:27:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 11:27:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2023-01-28 11:27:23,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4706713780918728 [2023-01-28 11:27:23,028 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions. [2023-01-28 11:27:23,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions. [2023-01-28 11:27:23,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:27:23,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions. [2023-01-28 11:27:23,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,039 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,040 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 68 flow. Second operand 5 states and 666 transitions. [2023-01-28 11:27:23,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 230 flow [2023-01-28 11:27:23,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 51 transitions, 207 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-01-28 11:27:23,043 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 84 flow [2023-01-28 11:27:23,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2023-01-28 11:27:23,047 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-01-28 11:27:23,047 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 84 flow [2023-01-28 11:27:23,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:27:23,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:27:23,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 11:27:23,048 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:27:23,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:27:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash 982828987, now seen corresponding path program 2 times [2023-01-28 11:27:23,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:27:23,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646055189] [2023-01-28 11:27:23,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:27:23,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:27:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:27:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:27:23,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:27:23,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646055189] [2023-01-28 11:27:23,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646055189] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:27:23,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:27:23,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 11:27:23,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28794238] [2023-01-28 11:27:23,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:27:23,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 11:27:23,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:27:23,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 11:27:23,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 11:27:23,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 283 [2023-01-28 11:27:23,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:27:23,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 283 [2023-01-28 11:27:23,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:27:23,426 INFO L130 PetriNetUnfolder]: 474/756 cut-off events. [2023-01-28 11:27:23,426 INFO L131 PetriNetUnfolder]: For 199/199 co-relation queries the response was YES. [2023-01-28 11:27:23,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1752 conditions, 756 events. 474/756 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2877 event pairs, 37 based on Foata normal form. 20/717 useless extension candidates. Maximal degree in co-relation 658. Up to 278 conditions per place. [2023-01-28 11:27:23,428 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 59 selfloop transitions, 6 changer transitions 4/69 dead transitions. [2023-01-28 11:27:23,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 69 transitions, 318 flow [2023-01-28 11:27:23,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 11:27:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 11:27:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 888 transitions. [2023-01-28 11:27:23,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482584553255931 [2023-01-28 11:27:23,430 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 888 transitions. [2023-01-28 11:27:23,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 888 transitions. [2023-01-28 11:27:23,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:27:23,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 888 transitions. [2023-01-28 11:27:23,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,437 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,437 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 84 flow. Second operand 7 states and 888 transitions. [2023-01-28 11:27:23,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 69 transitions, 318 flow [2023-01-28 11:27:23,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 69 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 11:27:23,440 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 98 flow [2023-01-28 11:27:23,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=98, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-01-28 11:27:23,440 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-01-28 11:27:23,440 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 98 flow [2023-01-28 11:27:23,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:27:23,441 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-28 11:27:23,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 11:27:23,441 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:27:23,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:27:23,443 INFO L85 PathProgramCache]: Analyzing trace with hash 165954322, now seen corresponding path program 1 times [2023-01-28 11:27:23,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:27:23,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145940028] [2023-01-28 11:27:23,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:27:23,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:27:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:27:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:27:23,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:27:23,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145940028] [2023-01-28 11:27:23,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145940028] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:27:23,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:27:23,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 11:27:23,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876686544] [2023-01-28 11:27:23,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:27:23,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 11:27:23,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:27:23,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 11:27:23,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 11:27:23,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-01-28 11:27:23,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:27:23,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-01-28 11:27:23,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:27:23,627 INFO L130 PetriNetUnfolder]: 205/384 cut-off events. [2023-01-28 11:27:23,627 INFO L131 PetriNetUnfolder]: For 483/483 co-relation queries the response was YES. [2023-01-28 11:27:23,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 384 events. 205/384 cut-off events. For 483/483 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1426 event pairs, 87 based on Foata normal form. 14/354 useless extension candidates. Maximal degree in co-relation 662. Up to 264 conditions per place. [2023-01-28 11:27:23,629 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 28 selfloop transitions, 2 changer transitions 3/38 dead transitions. [2023-01-28 11:27:23,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 196 flow [2023-01-28 11:27:23,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 11:27:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 11:27:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-01-28 11:27:23,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817432273262662 [2023-01-28 11:27:23,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-01-28 11:27:23,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-01-28 11:27:23,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:27:23,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-01-28 11:27:23,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,634 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 98 flow. Second operand 3 states and 409 transitions. [2023-01-28 11:27:23,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 196 flow [2023-01-28 11:27:23,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 174 flow, removed 1 selfloop flow, removed 8 redundant places. [2023-01-28 11:27:23,636 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 92 flow [2023-01-28 11:27:23,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2023-01-28 11:27:23,637 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-01-28 11:27:23,639 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 92 flow [2023-01-28 11:27:23,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:27:23,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:27:23,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 11:27:23,640 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:27:23,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:27:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1306821357, now seen corresponding path program 1 times [2023-01-28 11:27:23,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:27:23,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078829553] [2023-01-28 11:27:23,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:27:23,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:27:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:27:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:27:23,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:27:23,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078829553] [2023-01-28 11:27:23,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078829553] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:27:23,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:27:23,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 11:27:23,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260272691] [2023-01-28 11:27:23,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:27:23,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 11:27:23,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:27:23,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 11:27:23,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 11:27:23,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 283 [2023-01-28 11:27:23,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:27:23,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 283 [2023-01-28 11:27:23,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:27:23,812 INFO L130 PetriNetUnfolder]: 234/450 cut-off events. [2023-01-28 11:27:23,812 INFO L131 PetriNetUnfolder]: For 294/294 co-relation queries the response was YES. [2023-01-28 11:27:23,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 450 events. 234/450 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1779 event pairs, 187 based on Foata normal form. 10/402 useless extension candidates. Maximal degree in co-relation 746. Up to 330 conditions per place. [2023-01-28 11:27:23,814 INFO L137 encePairwiseOnDemand]: 279/283 looper letters, 22 selfloop transitions, 2 changer transitions 12/41 dead transitions. [2023-01-28 11:27:23,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 197 flow [2023-01-28 11:27:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 11:27:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 11:27:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-01-28 11:27:23,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44876325088339225 [2023-01-28 11:27:23,822 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-01-28 11:27:23,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-01-28 11:27:23,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:27:23,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-01-28 11:27:23,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,827 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,827 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 92 flow. Second operand 4 states and 508 transitions. [2023-01-28 11:27:23,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 197 flow [2023-01-28 11:27:23,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 11:27:23,830 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 104 flow [2023-01-28 11:27:23,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, 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=4, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-01-28 11:27:23,832 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2023-01-28 11:27:23,832 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 104 flow [2023-01-28 11:27:23,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:23,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:27:23,832 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, 1, 1] [2023-01-28 11:27:23,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 11:27:23,832 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:27:23,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:27:23,833 INFO L85 PathProgramCache]: Analyzing trace with hash -372538144, now seen corresponding path program 1 times [2023-01-28 11:27:23,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:27:23,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783341357] [2023-01-28 11:27:23,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:27:23,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:27:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:27:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:27:24,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:27:24,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783341357] [2023-01-28 11:27:24,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783341357] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:27:24,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582513851] [2023-01-28 11:27:24,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:27:24,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:27:24,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:27:24,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:27:24,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 11:27:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:27:24,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 50 conjunts are in the unsatisfiable core [2023-01-28 11:27:24,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:27:24,903 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 15 treesize of output 11 [2023-01-28 11:27:24,979 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-28 11:27:25,091 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-28 11:27:25,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:27:25,208 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 18 treesize of output 20 [2023-01-28 11:27:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:27:25,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:27:25,436 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_129 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2023-01-28 11:27:25,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:27:25,766 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 65 treesize of output 53 [2023-01-28 11:27:25,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:27:25,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 484 treesize of output 460 [2023-01-28 11:27:25,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2023-01-28 11:27:25,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:27:25,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 122 [2023-01-28 11:27:25,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:27:25,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 109 [2023-01-28 11:27:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-28 11:27:26,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582513851] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:27:26,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:27:26,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2023-01-28 11:27:26,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660876326] [2023-01-28 11:27:26,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:27:26,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-28 11:27:26,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:27:26,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-28 11:27:26,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=979, Unknown=2, NotChecked=64, Total=1190 [2023-01-28 11:27:26,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 283 [2023-01-28 11:27:26,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 104 flow. Second operand has 35 states, 35 states have (on average 73.8) internal successors, (2583), 35 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:26,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:27:26,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 283 [2023-01-28 11:27:26,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:27:31,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:27:34,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:27:36,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:27:38,062 INFO L130 PetriNetUnfolder]: 1549/2684 cut-off events. [2023-01-28 11:27:38,062 INFO L131 PetriNetUnfolder]: For 1522/1522 co-relation queries the response was YES. [2023-01-28 11:27:38,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7122 conditions, 2684 events. 1549/2684 cut-off events. For 1522/1522 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14915 event pairs, 40 based on Foata normal form. 49/2504 useless extension candidates. Maximal degree in co-relation 7105. Up to 529 conditions per place. [2023-01-28 11:27:38,071 INFO L137 encePairwiseOnDemand]: 266/283 looper letters, 296 selfloop transitions, 159 changer transitions 83/538 dead transitions. [2023-01-28 11:27:38,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 538 transitions, 2677 flow [2023-01-28 11:27:38,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-01-28 11:27:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2023-01-28 11:27:38,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 6151 transitions. [2023-01-28 11:27:38,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27865361964301893 [2023-01-28 11:27:38,086 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 6151 transitions. [2023-01-28 11:27:38,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 6151 transitions. [2023-01-28 11:27:38,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:27:38,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 6151 transitions. [2023-01-28 11:27:38,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 78.85897435897436) internal successors, (6151), 78 states have internal predecessors, (6151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:38,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 283.0) internal successors, (22357), 79 states have internal predecessors, (22357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:38,120 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 283.0) internal successors, (22357), 79 states have internal predecessors, (22357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:38,121 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 104 flow. Second operand 78 states and 6151 transitions. [2023-01-28 11:27:38,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 538 transitions, 2677 flow [2023-01-28 11:27:38,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 538 transitions, 2649 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-01-28 11:27:38,130 INFO L231 Difference]: Finished difference. Result has 160 places, 196 transitions, 1336 flow [2023-01-28 11:27:38,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=1336, PETRI_PLACES=160, PETRI_TRANSITIONS=196} [2023-01-28 11:27:38,132 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 128 predicate places. [2023-01-28 11:27:38,132 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 196 transitions, 1336 flow [2023-01-28 11:27:38,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 73.8) internal successors, (2583), 35 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:38,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:27:38,133 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, 1, 1] [2023-01-28 11:27:38,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-28 11:27:38,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:27:38,338 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:27:38,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:27:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash -708902324, now seen corresponding path program 2 times [2023-01-28 11:27:38,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:27:38,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616011789] [2023-01-28 11:27:38,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:27:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:27:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:27:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:27:39,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:27:39,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616011789] [2023-01-28 11:27:39,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616011789] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:27:39,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365212840] [2023-01-28 11:27:39,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 11:27:39,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:27:39,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:27:39,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:27:39,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 11:27:39,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:27:39,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:27:39,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 28 conjunts are in the unsatisfiable core [2023-01-28 11:27:39,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:27:39,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:27:39,413 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 18 treesize of output 20 [2023-01-28 11:27:39,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:27:39,453 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 18 treesize of output 20 [2023-01-28 11:27:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:27:39,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:27:43,805 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:27:43,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 174 [2023-01-28 11:27:43,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2023-01-28 11:27:43,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-01-28 11:27:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:27:43,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365212840] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:27:43,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:27:43,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2023-01-28 11:27:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103547411] [2023-01-28 11:27:43,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:27:43,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-28 11:27:43,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:27:43,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-28 11:27:43,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=930, Unknown=8, NotChecked=0, Total=1056 [2023-01-28 11:27:43,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 283 [2023-01-28 11:27:43,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 196 transitions, 1336 flow. Second operand has 33 states, 33 states have (on average 76.93939393939394) internal successors, (2539), 33 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:43,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:27:43,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 283 [2023-01-28 11:27:43,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:27:46,686 INFO L130 PetriNetUnfolder]: 1487/2632 cut-off events. [2023-01-28 11:27:46,686 INFO L131 PetriNetUnfolder]: For 56167/56167 co-relation queries the response was YES. [2023-01-28 11:27:46,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15091 conditions, 2632 events. 1487/2632 cut-off events. For 56167/56167 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 14524 event pairs, 53 based on Foata normal form. 28/2659 useless extension candidates. Maximal degree in co-relation 14682. Up to 527 conditions per place. [2023-01-28 11:27:46,707 INFO L137 encePairwiseOnDemand]: 270/283 looper letters, 256 selfloop transitions, 167 changer transitions 43/466 dead transitions. [2023-01-28 11:27:46,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 466 transitions, 5202 flow [2023-01-28 11:27:46,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-28 11:27:46,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-01-28 11:27:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3107 transitions. [2023-01-28 11:27:46,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2889157522782221 [2023-01-28 11:27:46,711 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3107 transitions. [2023-01-28 11:27:46,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3107 transitions. [2023-01-28 11:27:46,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:27:46,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3107 transitions. [2023-01-28 11:27:46,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 81.76315789473684) internal successors, (3107), 38 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:46,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 283.0) internal successors, (11037), 39 states have internal predecessors, (11037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:46,725 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 283.0) internal successors, (11037), 39 states have internal predecessors, (11037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:46,725 INFO L175 Difference]: Start difference. First operand has 160 places, 196 transitions, 1336 flow. Second operand 38 states and 3107 transitions. [2023-01-28 11:27:46,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 466 transitions, 5202 flow [2023-01-28 11:27:46,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 466 transitions, 4852 flow, removed 129 selfloop flow, removed 10 redundant places. [2023-01-28 11:27:46,793 INFO L231 Difference]: Finished difference. Result has 191 places, 251 transitions, 2115 flow [2023-01-28 11:27:46,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=2115, PETRI_PLACES=191, PETRI_TRANSITIONS=251} [2023-01-28 11:27:46,795 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 159 predicate places. [2023-01-28 11:27:46,795 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 251 transitions, 2115 flow [2023-01-28 11:27:46,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 76.93939393939394) internal successors, (2539), 33 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:46,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:27:46,796 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 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-28 11:27:46,801 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-28 11:27:47,000 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,SelfDestructingSolverStorable5 [2023-01-28 11:27:47,001 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:27:47,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:27:47,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1109082783, now seen corresponding path program 3 times [2023-01-28 11:27:47,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:27:47,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582535352] [2023-01-28 11:27:47,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:27:47,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:27:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:27:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:27:47,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:27:47,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582535352] [2023-01-28 11:27:47,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582535352] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:27:47,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:27:47,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 11:27:47,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824094631] [2023-01-28 11:27:47,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:27:47,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 11:27:47,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:27:47,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 11:27:47,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 11:27:47,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 283 [2023-01-28 11:27:47,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 251 transitions, 2115 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:47,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:27:47,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 283 [2023-01-28 11:27:47,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:27:47,550 INFO L130 PetriNetUnfolder]: 1820/3654 cut-off events. [2023-01-28 11:27:47,550 INFO L131 PetriNetUnfolder]: For 76565/76700 co-relation queries the response was YES. [2023-01-28 11:27:47,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22429 conditions, 3654 events. 1820/3654 cut-off events. For 76565/76700 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 24758 event pairs, 442 based on Foata normal form. 182/3740 useless extension candidates. Maximal degree in co-relation 22237. Up to 1312 conditions per place. [2023-01-28 11:27:47,585 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 239 selfloop transitions, 41 changer transitions 42/374 dead transitions. [2023-01-28 11:27:47,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 374 transitions, 3792 flow [2023-01-28 11:27:47,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 11:27:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 11:27:47,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2023-01-28 11:27:47,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035335689045937 [2023-01-28 11:27:47,586 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2023-01-28 11:27:47,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2023-01-28 11:27:47,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:27:47,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2023-01-28 11:27:47,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:47,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:47,589 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:47,589 INFO L175 Difference]: Start difference. First operand has 191 places, 251 transitions, 2115 flow. Second operand 4 states and 570 transitions. [2023-01-28 11:27:47,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 374 transitions, 3792 flow [2023-01-28 11:27:47,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 374 transitions, 3465 flow, removed 62 selfloop flow, removed 14 redundant places. [2023-01-28 11:27:47,698 INFO L231 Difference]: Finished difference. Result has 182 places, 260 transitions, 2157 flow [2023-01-28 11:27:47,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2157, PETRI_PLACES=182, PETRI_TRANSITIONS=260} [2023-01-28 11:27:47,699 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 150 predicate places. [2023-01-28 11:27:47,699 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 260 transitions, 2157 flow [2023-01-28 11:27:47,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:47,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:27:47,699 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:27:47,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 11:27:47,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:27:47,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:27:47,700 INFO L85 PathProgramCache]: Analyzing trace with hash -582912098, now seen corresponding path program 4 times [2023-01-28 11:27:47,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:27:47,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161302410] [2023-01-28 11:27:47,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:27:47,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:27:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:27:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 11:27:47,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:27:47,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161302410] [2023-01-28 11:27:47,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161302410] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:27:47,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814948276] [2023-01-28 11:27:47,780 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 11:27:47,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:27:47,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:27:47,781 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:27:47,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 11:27:47,851 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 11:27:47,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:27:47,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 11:27:47,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:27:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 11:27:47,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:27:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 11:27:47,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814948276] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:27:47,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:27:47,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-28 11:27:47,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691023044] [2023-01-28 11:27:47,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:27:47,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 11:27:47,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:27:47,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 11:27:47,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-01-28 11:27:47,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 283 [2023-01-28 11:27:47,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 260 transitions, 2157 flow. Second operand has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:47,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:27:47,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 283 [2023-01-28 11:27:47,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:27:48,307 INFO L130 PetriNetUnfolder]: 1228/2638 cut-off events. [2023-01-28 11:27:48,307 INFO L131 PetriNetUnfolder]: For 52978/53093 co-relation queries the response was YES. [2023-01-28 11:27:48,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15886 conditions, 2638 events. 1228/2638 cut-off events. For 52978/53093 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 17317 event pairs, 624 based on Foata normal form. 54/2622 useless extension candidates. Maximal degree in co-relation 15826. Up to 1978 conditions per place. [2023-01-28 11:27:48,327 INFO L137 encePairwiseOnDemand]: 279/283 looper letters, 140 selfloop transitions, 3 changer transitions 36/212 dead transitions. [2023-01-28 11:27:48,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 212 transitions, 2194 flow [2023-01-28 11:27:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 11:27:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 11:27:48,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 742 transitions. [2023-01-28 11:27:48,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4369846878680801 [2023-01-28 11:27:48,335 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 742 transitions. [2023-01-28 11:27:48,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 742 transitions. [2023-01-28 11:27:48,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:27:48,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 742 transitions. [2023-01-28 11:27:48,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:48,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:48,347 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:48,347 INFO L175 Difference]: Start difference. First operand has 182 places, 260 transitions, 2157 flow. Second operand 6 states and 742 transitions. [2023-01-28 11:27:48,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 212 transitions, 2194 flow [2023-01-28 11:27:48,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 212 transitions, 2087 flow, removed 43 selfloop flow, removed 11 redundant places. [2023-01-28 11:27:48,401 INFO L231 Difference]: Finished difference. Result has 160 places, 176 transitions, 1461 flow [2023-01-28 11:27:48,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1600, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1461, PETRI_PLACES=160, PETRI_TRANSITIONS=176} [2023-01-28 11:27:48,401 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 128 predicate places. [2023-01-28 11:27:48,401 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 176 transitions, 1461 flow [2023-01-28 11:27:48,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:48,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:27:48,402 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:27:48,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 11:27:48,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:27:48,612 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:27:48,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:27:48,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1913761, now seen corresponding path program 5 times [2023-01-28 11:27:48,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:27:48,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116785417] [2023-01-28 11:27:48,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:27:48,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:27:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:27:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:27:49,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:27:49,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116785417] [2023-01-28 11:27:49,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116785417] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:27:49,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628056833] [2023-01-28 11:27:49,698 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 11:27:49,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:27:49,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:27:49,699 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:27:49,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 11:27:49,781 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-28 11:27:49,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:27:49,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 65 conjunts are in the unsatisfiable core [2023-01-28 11:27:49,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:27:49,891 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 15 treesize of output 11 [2023-01-28 11:27:49,946 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-28 11:27:50,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:27:50,113 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 19 treesize of output 21 [2023-01-28 11:27:50,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:27:50,161 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 19 treesize of output 21 [2023-01-28 11:27:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:27:50,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:27:51,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:27:51,399 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 127 treesize of output 91 [2023-01-28 11:27:51,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:27:51,424 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 1636 treesize of output 1560 [2023-01-28 11:27:51,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:27:51,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 274 treesize of output 284 [2023-01-28 11:27:51,496 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:27:51,497 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 340 treesize of output 278 [2023-01-28 11:27:51,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:27:51,519 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 201 treesize of output 179 [2023-01-28 11:27:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:27:54,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628056833] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:27:54,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:27:54,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2023-01-28 11:27:54,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016794851] [2023-01-28 11:27:54,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:27:54,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-01-28 11:27:54,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:27:54,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-01-28 11:27:54,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2073, Unknown=8, NotChecked=0, Total=2352 [2023-01-28 11:27:54,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 283 [2023-01-28 11:27:54,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 176 transitions, 1461 flow. Second operand has 49 states, 49 states have (on average 73.63265306122449) internal successors, (3608), 49 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:27:54,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:27:54,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 283 [2023-01-28 11:27:54,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:28:24,139 INFO L130 PetriNetUnfolder]: 7079/12642 cut-off events. [2023-01-28 11:28:24,139 INFO L131 PetriNetUnfolder]: For 147546/147546 co-relation queries the response was YES. [2023-01-28 11:28:24,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68716 conditions, 12642 events. 7079/12642 cut-off events. For 147546/147546 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 94237 event pairs, 306 based on Foata normal form. 175/12817 useless extension candidates. Maximal degree in co-relation 68664. Up to 2419 conditions per place. [2023-01-28 11:28:24,211 INFO L137 encePairwiseOnDemand]: 267/283 looper letters, 694 selfloop transitions, 613 changer transitions 156/1463 dead transitions. [2023-01-28 11:28:24,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 1463 transitions, 14875 flow [2023-01-28 11:28:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2023-01-28 11:28:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2023-01-28 11:28:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 10819 transitions. [2023-01-28 11:28:24,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2790487735678729 [2023-01-28 11:28:24,221 INFO L72 ComplementDD]: Start complementDD. Operand 137 states and 10819 transitions. [2023-01-28 11:28:24,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 10819 transitions. [2023-01-28 11:28:24,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:28:24,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 137 states and 10819 transitions. [2023-01-28 11:28:24,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 138 states, 137 states have (on average 78.97080291970804) internal successors, (10819), 137 states have internal predecessors, (10819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:28:24,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 138 states, 138 states have (on average 283.0) internal successors, (39054), 138 states have internal predecessors, (39054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:28:24,270 INFO L81 ComplementDD]: Finished complementDD. Result has 138 states, 138 states have (on average 283.0) internal successors, (39054), 138 states have internal predecessors, (39054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:28:24,270 INFO L175 Difference]: Start difference. First operand has 160 places, 176 transitions, 1461 flow. Second operand 137 states and 10819 transitions. [2023-01-28 11:28:24,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 1463 transitions, 14875 flow [2023-01-28 11:28:24,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 1463 transitions, 14317 flow, removed 276 selfloop flow, removed 12 redundant places. [2023-01-28 11:28:24,712 INFO L231 Difference]: Finished difference. Result has 326 places, 733 transitions, 9176 flow [2023-01-28 11:28:24,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=137, PETRI_FLOW=9176, PETRI_PLACES=326, PETRI_TRANSITIONS=733} [2023-01-28 11:28:24,713 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 294 predicate places. [2023-01-28 11:28:24,713 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 733 transitions, 9176 flow [2023-01-28 11:28:24,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 73.63265306122449) internal successors, (3608), 49 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:28:24,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:28:24,714 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:28:24,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 11:28:24,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:28:24,918 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:28:24,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:28:24,919 INFO L85 PathProgramCache]: Analyzing trace with hash -574403061, now seen corresponding path program 6 times [2023-01-28 11:28:24,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:28:24,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210205822] [2023-01-28 11:28:24,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:28:24,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:28:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:28:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:28:26,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:28:26,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210205822] [2023-01-28 11:28:26,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210205822] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:28:26,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708889822] [2023-01-28 11:28:26,210 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 11:28:26,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:28:26,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:28:26,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:28:26,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 11:28:26,378 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-28 11:28:26,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:28:26,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 55 conjunts are in the unsatisfiable core [2023-01-28 11:28:26,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:28:26,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:28:26,792 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 18 treesize of output 20 [2023-01-28 11:28:27,121 INFO L321 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2023-01-28 11:28:27,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 13 [2023-01-28 11:28:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:28:27,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:28:27,714 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-28 11:28:27,714 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 100 treesize of output 103 [2023-01-28 11:28:27,730 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:28:27,730 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 50 treesize of output 49 [2023-01-28 11:28:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:28:28,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708889822] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:28:28,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:28:28,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2023-01-28 11:28:28,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915787619] [2023-01-28 11:28:28,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:28:28,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-01-28 11:28:28,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:28:28,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-01-28 11:28:28,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2023, Unknown=2, NotChecked=0, Total=2256 [2023-01-28 11:28:28,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 283 [2023-01-28 11:28:28,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 733 transitions, 9176 flow. Second operand has 48 states, 48 states have (on average 73.70833333333333) internal successors, (3538), 48 states have internal predecessors, (3538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:28:28,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:28:28,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 283 [2023-01-28 11:28:28,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:28:38,243 WARN L222 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:28:52,113 WARN L222 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:28:54,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:28:59,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:29:01,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:29:15,798 WARN L222 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:29:17,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:29:45,200 WARN L222 SmtUtils]: Spent 24.45s on a formula simplification. DAG size of input: 91 DAG size of output: 81 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:29:47,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:29:50,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:29:57,330 WARN L222 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:30:09,865 WARN L222 SmtUtils]: Spent 12.25s on a formula simplification. DAG size of input: 73 DAG size of output: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:30:20,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:30:22,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:30:34,976 WARN L222 SmtUtils]: Spent 12.17s on a formula simplification. DAG size of input: 75 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:30:41,616 WARN L222 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:31:06,678 WARN L222 SmtUtils]: Spent 22.43s on a formula simplification. DAG size of input: 88 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:31:13,317 WARN L222 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:31:19,663 WARN L222 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:31:21,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:31:25,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:31:27,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:31:30,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:31:51,413 WARN L222 SmtUtils]: Spent 18.28s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:31:54,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:32:03,340 WARN L222 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:32:11,714 WARN L222 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:32:22,075 WARN L222 SmtUtils]: Spent 10.27s on a formula simplification. DAG size of input: 95 DAG size of output: 90 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:32:24,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:32:33,390 WARN L222 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:32:40,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:32:47,480 WARN L222 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:33:10,507 WARN L222 SmtUtils]: Spent 20.29s on a formula simplification. DAG size of input: 97 DAG size of output: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:33:30,307 WARN L222 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:33:43,223 WARN L222 SmtUtils]: Spent 12.22s on a formula simplification. DAG size of input: 70 DAG size of output: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:33:50,094 WARN L222 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:33:53,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:34:02,358 WARN L222 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:34:10,798 WARN L222 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:34:27,539 WARN L222 SmtUtils]: Spent 12.29s on a formula simplification. DAG size of input: 67 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:34:34,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:34:36,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:34:39,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:34:43,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:34:46,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:34:56,524 WARN L222 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:35:09,234 WARN L222 SmtUtils]: Spent 12.20s on a formula simplification. DAG size of input: 74 DAG size of output: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:35:11,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:35:13,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:35:15,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:35:17,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:35:19,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:35:37,582 WARN L222 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:35:40,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:35:54,273 WARN L222 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:36:02,925 WARN L222 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:36:21,385 WARN L222 SmtUtils]: Spent 18.34s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:36:23,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:36:25,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:36:27,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:36:59,207 WARN L222 SmtUtils]: Spent 24.43s on a formula simplification. DAG size of input: 90 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:37:07,577 WARN L222 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:37:15,820 WARN L222 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:37:28,914 WARN L222 SmtUtils]: Spent 10.28s on a formula simplification. DAG size of input: 93 DAG size of output: 92 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:37:40,875 WARN L222 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:37:44,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:37:53,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:38:02,443 WARN L222 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 80 DAG size of output: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:38:18,117 WARN L222 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 83 DAG size of output: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:38:24,394 WARN L222 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 82 DAG size of output: 81 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:38:26,209 INFO L130 PetriNetUnfolder]: 40712/71221 cut-off events. [2023-01-28 11:38:26,209 INFO L131 PetriNetUnfolder]: For 3161625/3161625 co-relation queries the response was YES. [2023-01-28 11:38:27,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555314 conditions, 71221 events. 40712/71221 cut-off events. For 3161625/3161625 co-relation queries the response was YES. Maximal size of possible extension queue 2270. Compared 645620 event pairs, 3408 based on Foata normal form. 1897/73118 useless extension candidates. Maximal degree in co-relation 555212. Up to 15021 conditions per place. [2023-01-28 11:38:27,678 INFO L137 encePairwiseOnDemand]: 267/283 looper letters, 2069 selfloop transitions, 3237 changer transitions 2144/7450 dead transitions. [2023-01-28 11:38:27,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 7450 transitions, 107989 flow [2023-01-28 11:38:27,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 317 states. [2023-01-28 11:38:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2023-01-28 11:38:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 25277 transitions. [2023-01-28 11:38:27,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28176031924736095 [2023-01-28 11:38:27,723 INFO L72 ComplementDD]: Start complementDD. Operand 317 states and 25277 transitions. [2023-01-28 11:38:27,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 25277 transitions. [2023-01-28 11:38:27,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:38:27,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 317 states and 25277 transitions. [2023-01-28 11:38:27,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 318 states, 317 states have (on average 79.73817034700315) internal successors, (25277), 317 states have internal predecessors, (25277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:38:27,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 318 states, 318 states have (on average 283.0) internal successors, (89994), 318 states have internal predecessors, (89994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:38:27,938 INFO L81 ComplementDD]: Finished complementDD. Result has 318 states, 318 states have (on average 283.0) internal successors, (89994), 318 states have internal predecessors, (89994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:38:27,938 INFO L175 Difference]: Start difference. First operand has 326 places, 733 transitions, 9176 flow. Second operand 317 states and 25277 transitions. [2023-01-28 11:38:27,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 7450 transitions, 107989 flow [2023-01-28 11:39:05,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 7450 transitions, 96687 flow, removed 3859 selfloop flow, removed 15 redundant places. [2023-01-28 11:39:06,035 INFO L231 Difference]: Finished difference. Result has 776 places, 3691 transitions, 65049 flow [2023-01-28 11:39:06,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=7323, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=500, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=317, PETRI_FLOW=65049, PETRI_PLACES=776, PETRI_TRANSITIONS=3691} [2023-01-28 11:39:06,036 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 744 predicate places. [2023-01-28 11:39:06,036 INFO L495 AbstractCegarLoop]: Abstraction has has 776 places, 3691 transitions, 65049 flow [2023-01-28 11:39:06,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 73.70833333333333) internal successors, (3538), 48 states have internal predecessors, (3538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:39:06,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:39:06,037 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:39:06,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 11:39:06,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-01-28 11:39:06,244 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:39:06,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:39:06,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1938354749, now seen corresponding path program 7 times [2023-01-28 11:39:06,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:39:06,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847104529] [2023-01-28 11:39:06,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:39:06,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:39:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:39:07,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:39:07,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:39:07,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847104529] [2023-01-28 11:39:07,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847104529] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:39:07,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874971960] [2023-01-28 11:39:07,357 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 11:39:07,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:39:07,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:39:07,358 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:39:07,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 11:39:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:39:07,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 54 conjunts are in the unsatisfiable core [2023-01-28 11:39:07,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:39:07,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:39:07,758 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 18 treesize of output 20 [2023-01-28 11:39:07,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:39:07,995 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 30 treesize of output 30 [2023-01-28 11:39:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:39:08,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:39:08,289 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_393 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_393) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0) (+ c_~W~0 1))) is different from false [2023-01-28 11:39:08,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:39:08,573 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 296 treesize of output 265 [2023-01-28 11:39:08,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 81 [2023-01-28 11:39:08,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:39:08,596 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 75 treesize of output 67 [2023-01-28 11:39:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 11:39:09,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874971960] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:39:09,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:39:09,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 45 [2023-01-28 11:39:09,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831609508] [2023-01-28 11:39:09,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:39:09,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-01-28 11:39:09,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:39:09,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-01-28 11:39:09,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1810, Unknown=9, NotChecked=86, Total=2070 [2023-01-28 11:39:09,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 283 [2023-01-28 11:39:09,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 776 places, 3691 transitions, 65049 flow. Second operand has 46 states, 46 states have (on average 76.76086956521739) internal successors, (3531), 46 states have internal predecessors, (3531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:39:09,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:39:09,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 283 [2023-01-28 11:39:09,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:39:31,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:39:33,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:39:47,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:39:49,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:40:31,690 WARN L222 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 79 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-01-28 11:40:54,539 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 11:40:54,539 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 11:40:55,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-28 11:40:55,741 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-28 11:40:55,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2023-01-28 11:40:55,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 11:40:55,762 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.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-28 11:40:55,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-01-28 11:40:55,765 INFO L158 Benchmark]: Toolchain (without parser) took 817850.83ms. Allocated memory was 356.5MB in the beginning and 3.3GB in the end (delta: 2.9GB). Free memory was 325.2MB in the beginning and 1.2GB in the end (delta: -871.5MB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. [2023-01-28 11:40:55,765 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 213.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 11:40:55,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.47ms. Allocated memory is still 356.5MB. Free memory was 325.2MB in the beginning and 313.6MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-28 11:40:55,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.12ms. Allocated memory is still 356.5MB. Free memory was 313.6MB in the beginning and 311.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 11:40:55,765 INFO L158 Benchmark]: Boogie Preprocessor took 24.70ms. Allocated memory is still 356.5MB. Free memory was 311.4MB in the beginning and 309.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 11:40:55,765 INFO L158 Benchmark]: RCFGBuilder took 434.34ms. Allocated memory is still 356.5MB. Free memory was 309.8MB in the beginning and 287.5MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 11:40:55,766 INFO L158 Benchmark]: TraceAbstraction took 817214.44ms. Allocated memory was 356.5MB in the beginning and 3.3GB in the end (delta: 2.9GB). Free memory was 286.7MB in the beginning and 1.2GB in the end (delta: -910.0MB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2023-01-28 11:40:55,766 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.09ms. Allocated memory is still 255.9MB. Free memory is still 213.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 150.47ms. Allocated memory is still 356.5MB. Free memory was 325.2MB in the beginning and 313.6MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 23.12ms. Allocated memory is still 356.5MB. Free memory was 313.6MB in the beginning and 311.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.70ms. Allocated memory is still 356.5MB. Free memory was 311.4MB in the beginning and 309.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 434.34ms. Allocated memory is still 356.5MB. Free memory was 309.8MB in the beginning and 287.5MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 817214.44ms. Allocated memory was 356.5MB in the beginning and 3.3GB in the end (delta: 2.9GB). Free memory was 286.7MB in the beginning and 1.2GB in the end (delta: -910.0MB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 134 PlacesBefore, 32 PlacesAfterwards, 135 TransitionsBefore, 25 TransitionsAfterwards, 1082 CoEnabledTransitionPairs, 7 FixpointIterations, 77 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 135 TotalNumberOfCompositions, 2030 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1324, independent: 1249, independent conditional: 0, independent unconditional: 1249, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 612, independent: 593, independent conditional: 0, independent unconditional: 593, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1324, independent: 656, independent conditional: 0, independent unconditional: 656, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 612, unknown conditional: 0, unknown unconditional: 612] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, 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