/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-more-sorted.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 11:12:32,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 11:12:32,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 11:12:32,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 11:12:32,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 11:12:32,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 11:12:32,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 11:12:32,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 11:12:32,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 11:12:32,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 11:12:32,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 11:12:32,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 11:12:32,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 11:12:32,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 11:12:32,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 11:12:32,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 11:12:32,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 11:12:32,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 11:12:32,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 11:12:32,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 11:12:32,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 11:12:32,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 11:12:32,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 11:12:32,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 11:12:32,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 11:12:32,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 11:12:32,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 11:12:32,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 11:12:32,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 11:12:32,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 11:12:32,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 11:12:32,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 11:12:32,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 11:12:32,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 11:12:32,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 11:12:32,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 11:12:32,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 11:12:32,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 11:12:32,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 11:12:32,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 11:12:32,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 11:12:32,680 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:12:32,701 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 11:12:32,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 11:12:32,703 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 11:12:32,703 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 11:12:32,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 11:12:32,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 11:12:32,704 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 11:12:32,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 11:12:32,704 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 11:12:32,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 11:12:32,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 11:12:32,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 11:12:32,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 11:12:32,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 11:12:32,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 11:12:32,705 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 11:12:32,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 11:12:32,705 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 11:12:32,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 11:12:32,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 11:12:32,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 11:12:32,706 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 11:12:32,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 11:12:32,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 11:12:32,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 11:12:32,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 11:12:32,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 11:12:32,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 11:12:32,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 11:12:32,706 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 11:12:32,707 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 11:12:32,707 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:12:32,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 11:12:32,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 11:12:32,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 11:12:32,865 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 11:12:32,865 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 11:12:32,866 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2023-01-28 11:12:33,857 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 11:12:34,023 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 11:12:34,023 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2023-01-28 11:12:34,028 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab74ee89/2ec5f35e64be48e7a047b257ba2ef05a/FLAG89efe2228 [2023-01-28 11:12:34,037 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab74ee89/2ec5f35e64be48e7a047b257ba2ef05a [2023-01-28 11:12:34,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 11:12:34,039 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 11:12:34,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 11:12:34,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 11:12:34,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 11:12:34,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:12:34" (1/1) ... [2023-01-28 11:12:34,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c66ab8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:12:34, skipping insertion in model container [2023-01-28 11:12:34,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:12:34" (1/1) ... [2023-01-28 11:12:34,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 11:12:34,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 11:12:34,231 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c[2434,2447] [2023-01-28 11:12:34,236 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 11:12:34,242 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 11:12:34,256 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c[2434,2447] [2023-01-28 11:12:34,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 11:12:34,267 INFO L208 MainTranslator]: Completed translation [2023-01-28 11:12:34,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:12:34 WrapperNode [2023-01-28 11:12:34,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 11:12:34,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 11:12:34,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 11:12:34,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 11:12:34,273 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:12:34" (1/1) ... [2023-01-28 11:12:34,286 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:12:34" (1/1) ... [2023-01-28 11:12:34,300 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 108 [2023-01-28 11:12:34,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 11:12:34,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 11:12:34,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 11:12:34,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 11:12:34,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:12:34" (1/1) ... [2023-01-28 11:12:34,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:12:34" (1/1) ... [2023-01-28 11:12:34,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:12:34" (1/1) ... [2023-01-28 11:12:34,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:12:34" (1/1) ... [2023-01-28 11:12:34,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:12:34" (1/1) ... [2023-01-28 11:12:34,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:12:34" (1/1) ... [2023-01-28 11:12:34,317 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:12:34" (1/1) ... [2023-01-28 11:12:34,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:12:34" (1/1) ... [2023-01-28 11:12:34,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 11:12:34,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 11:12:34,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 11:12:34,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 11:12:34,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:12:34" (1/1) ... [2023-01-28 11:12:34,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 11:12:34,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:12:34,341 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:12:34,343 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:12:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 11:12:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 11:12:34,365 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 11:12:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 11:12:34,365 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 11:12:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 11:12:34,365 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 11:12:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 11:12:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 11:12:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 11:12:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 11:12:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 11:12:34,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 11:12:34,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 11:12:34,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 11:12:34,367 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:12:34,492 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 11:12:34,494 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 11:12:34,781 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 11:12:34,787 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 11:12:34,787 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-28 11:12:34,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:12:34 BoogieIcfgContainer [2023-01-28 11:12:34,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 11:12:34,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 11:12:34,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 11:12:34,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 11:12:34,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:12:34" (1/3) ... [2023-01-28 11:12:34,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f40c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:12:34, skipping insertion in model container [2023-01-28 11:12:34,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:12:34" (2/3) ... [2023-01-28 11:12:34,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f40c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:12:34, skipping insertion in model container [2023-01-28 11:12:34,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:12:34" (3/3) ... [2023-01-28 11:12:34,805 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2023-01-28 11:12:34,818 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 11:12:34,818 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 11:12:34,818 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 11:12:34,894 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-28 11:12:34,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 175 transitions, 374 flow [2023-01-28 11:12:34,971 INFO L130 PetriNetUnfolder]: 15/172 cut-off events. [2023-01-28 11:12:34,971 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 11:12:34,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 172 events. 15/172 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 204 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2023-01-28 11:12:34,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 175 transitions, 374 flow [2023-01-28 11:12:34,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 162 transitions, 342 flow [2023-01-28 11:12:34,985 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 11:12:34,991 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 162 transitions, 342 flow [2023-01-28 11:12:34,993 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 162 transitions, 342 flow [2023-01-28 11:12:34,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 162 transitions, 342 flow [2023-01-28 11:12:35,026 INFO L130 PetriNetUnfolder]: 15/162 cut-off events. [2023-01-28 11:12:35,026 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 11:12:35,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 162 events. 15/162 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2023-01-28 11:12:35,028 INFO L119 LiptonReduction]: Number of co-enabled transitions 3534 [2023-01-28 11:12:39,127 INFO L134 LiptonReduction]: Checked pairs total: 4092 [2023-01-28 11:12:39,128 INFO L136 LiptonReduction]: Total number of compositions: 166 [2023-01-28 11:12:39,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 11:12:39,141 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;@7f562910, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 11:12:39,141 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 11:12:39,147 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2023-01-28 11:12:39,147 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 11:12:39,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:12:39,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:12:39,148 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:12:39,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:12:39,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1548535715, now seen corresponding path program 1 times [2023-01-28 11:12:39,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:12:39,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730951440] [2023-01-28 11:12:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:39,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:12:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:39,496 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:12:39,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:12:39,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730951440] [2023-01-28 11:12:39,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730951440] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:12:39,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:12:39,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 11:12:39,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975810463] [2023-01-28 11:12:39,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:12:39,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 11:12:39,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:12:39,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 11:12:39,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 11:12:39,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 341 [2023-01-28 11:12:39,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:39,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:12:39,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 341 [2023-01-28 11:12:39,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:12:39,598 INFO L130 PetriNetUnfolder]: 543/714 cut-off events. [2023-01-28 11:12:39,598 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-01-28 11:12:39,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 714 events. 543/714 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2207 event pairs, 212 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 1213. Up to 697 conditions per place. [2023-01-28 11:12:39,603 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 24 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-01-28 11:12:39,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 128 flow [2023-01-28 11:12:39,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 11:12:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 11:12:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-01-28 11:12:39,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4398826979472141 [2023-01-28 11:12:39,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-01-28 11:12:39,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-01-28 11:12:39,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:12:39,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-01-28 11:12:39,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:39,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:39,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:39,625 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 3 states and 450 transitions. [2023-01-28 11:12:39,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 128 flow [2023-01-28 11:12:39,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-01-28 11:12:39,629 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 74 flow [2023-01-28 11:12:39,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2023-01-28 11:12:39,632 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2023-01-28 11:12:39,632 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 74 flow [2023-01-28 11:12:39,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:39,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:12:39,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:12:39,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 11:12:39,633 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:12:39,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:12:39,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2004951010, now seen corresponding path program 1 times [2023-01-28 11:12:39,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:12:39,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594005175] [2023-01-28 11:12:39,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:39,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:12:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:12:39,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:12:39,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594005175] [2023-01-28 11:12:39,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594005175] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:12:39,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:12:39,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 11:12:39,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42317499] [2023-01-28 11:12:39,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:12:39,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 11:12:39,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:12:39,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 11:12:39,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 11:12:39,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 341 [2023-01-28 11:12:39,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:39,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:12:39,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 341 [2023-01-28 11:12:39,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:12:40,113 INFO L130 PetriNetUnfolder]: 753/1008 cut-off events. [2023-01-28 11:12:40,113 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-01-28 11:12:40,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2043 conditions, 1008 events. 753/1008 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3502 event pairs, 95 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 2032. Up to 825 conditions per place. [2023-01-28 11:12:40,119 INFO L137 encePairwiseOnDemand]: 334/341 looper letters, 39 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2023-01-28 11:12:40,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 47 transitions, 203 flow [2023-01-28 11:12:40,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 11:12:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 11:12:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2023-01-28 11:12:40,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4760508308895406 [2023-01-28 11:12:40,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2023-01-28 11:12:40,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2023-01-28 11:12:40,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:12:40,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2023-01-28 11:12:40,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:40,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:40,128 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:40,128 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 74 flow. Second operand 3 states and 487 transitions. [2023-01-28 11:12:40,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 47 transitions, 203 flow [2023-01-28 11:12:40,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 199 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 11:12:40,130 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 100 flow [2023-01-28 11:12:40,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2023-01-28 11:12:40,130 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-01-28 11:12:40,131 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 100 flow [2023-01-28 11:12:40,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:40,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:12:40,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:12:40,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 11:12:40,131 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:12:40,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:12:40,133 INFO L85 PathProgramCache]: Analyzing trace with hash 610154948, now seen corresponding path program 1 times [2023-01-28 11:12:40,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:12:40,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126484141] [2023-01-28 11:12:40,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:40,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:12:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:40,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:12:40,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126484141] [2023-01-28 11:12:40,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126484141] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:40,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827568894] [2023-01-28 11:12:40,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:40,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:40,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:12:40,333 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:12:40,368 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:12:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:40,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 11:12:40,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:12:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:40,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:12:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:40,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827568894] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:12:40,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:12:40,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-28 11:12:40,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565657524] [2023-01-28 11:12:40,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:12:40,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 11:12:40,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:12:40,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 11:12:40,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-01-28 11:12:40,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 341 [2023-01-28 11:12:40,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 100 flow. Second operand has 12 states, 12 states have (on average 135.33333333333334) internal successors, (1624), 12 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:40,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:12:40,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 341 [2023-01-28 11:12:40,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:12:41,083 INFO L130 PetriNetUnfolder]: 1451/1990 cut-off events. [2023-01-28 11:12:41,083 INFO L131 PetriNetUnfolder]: For 456/458 co-relation queries the response was YES. [2023-01-28 11:12:41,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 1990 events. 1451/1990 cut-off events. For 456/458 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8476 event pairs, 397 based on Foata normal form. 66/1680 useless extension candidates. Maximal degree in co-relation 2520. Up to 758 conditions per place. [2023-01-28 11:12:41,091 INFO L137 encePairwiseOnDemand]: 335/341 looper letters, 80 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2023-01-28 11:12:41,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 88 transitions, 445 flow [2023-01-28 11:12:41,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 11:12:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 11:12:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1002 transitions. [2023-01-28 11:12:41,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4197737746124843 [2023-01-28 11:12:41,094 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1002 transitions. [2023-01-28 11:12:41,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1002 transitions. [2023-01-28 11:12:41,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:12:41,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1002 transitions. [2023-01-28 11:12:41,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.14285714285714) internal successors, (1002), 7 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:41,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:41,100 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:41,100 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 100 flow. Second operand 7 states and 1002 transitions. [2023-01-28 11:12:41,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 88 transitions, 445 flow [2023-01-28 11:12:41,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 88 transitions, 434 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 11:12:41,103 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 143 flow [2023-01-28 11:12:41,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2023-01-28 11:12:41,104 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-01-28 11:12:41,104 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 143 flow [2023-01-28 11:12:41,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 135.33333333333334) internal successors, (1624), 12 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:41,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:12:41,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:12:41,121 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:12:41,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:41,311 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:12:41,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:12:41,311 INFO L85 PathProgramCache]: Analyzing trace with hash -141297123, now seen corresponding path program 1 times [2023-01-28 11:12:41,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:12:41,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323720393] [2023-01-28 11:12:41,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:41,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:12:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:41,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:12:41,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323720393] [2023-01-28 11:12:41,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323720393] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:41,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692433073] [2023-01-28 11:12:41,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:41,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:41,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:12:41,415 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:12:41,475 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:12:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:41,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-01-28 11:12:41,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:12:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:41,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:12:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:41,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692433073] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:12:41,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:12:41,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-28 11:12:41,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443667473] [2023-01-28 11:12:41,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:12:41,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 11:12:41,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:12:41,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 11:12:41,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-01-28 11:12:41,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 341 [2023-01-28 11:12:41,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 143 flow. Second operand has 12 states, 12 states have (on average 138.58333333333334) internal successors, (1663), 12 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:41,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:12:41,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 341 [2023-01-28 11:12:41,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:12:41,793 INFO L130 PetriNetUnfolder]: 942/1371 cut-off events. [2023-01-28 11:12:41,794 INFO L131 PetriNetUnfolder]: For 627/679 co-relation queries the response was YES. [2023-01-28 11:12:41,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3520 conditions, 1371 events. 942/1371 cut-off events. For 627/679 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5932 event pairs, 343 based on Foata normal form. 64/1230 useless extension candidates. Maximal degree in co-relation 2541. Up to 612 conditions per place. [2023-01-28 11:12:41,800 INFO L137 encePairwiseOnDemand]: 334/341 looper letters, 70 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2023-01-28 11:12:41,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 424 flow [2023-01-28 11:12:41,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 11:12:41,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 11:12:41,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1023 transitions. [2023-01-28 11:12:41,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-01-28 11:12:41,802 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1023 transitions. [2023-01-28 11:12:41,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1023 transitions. [2023-01-28 11:12:41,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:12:41,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1023 transitions. [2023-01-28 11:12:41,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.14285714285714) internal successors, (1023), 7 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:41,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:41,807 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:41,808 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 143 flow. Second operand 7 states and 1023 transitions. [2023-01-28 11:12:41,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 424 flow [2023-01-28 11:12:41,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 79 transitions, 416 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-01-28 11:12:41,812 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 165 flow [2023-01-28 11:12:41,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=165, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-01-28 11:12:41,813 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2023-01-28 11:12:41,813 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 165 flow [2023-01-28 11:12:41,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 138.58333333333334) internal successors, (1663), 12 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:41,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:12:41,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:12:41,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 11:12:42,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-01-28 11:12:42,019 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:12:42,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:12:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash -990089336, now seen corresponding path program 1 times [2023-01-28 11:12:42,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:12:42,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764430518] [2023-01-28 11:12:42,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:42,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:12:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:42,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:12:42,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764430518] [2023-01-28 11:12:42,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764430518] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:42,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109131193] [2023-01-28 11:12:42,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:42,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:42,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:12:42,226 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:12:42,231 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:12:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:42,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 11:12:42,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:12:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:42,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:12:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:42,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109131193] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:12:42,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:12:42,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-01-28 11:12:42,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050986353] [2023-01-28 11:12:42,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:12:42,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 11:12:42,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:12:42,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 11:12:42,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-01-28 11:12:42,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 341 [2023-01-28 11:12:42,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 165 flow. Second operand has 14 states, 14 states have (on average 134.28571428571428) internal successors, (1880), 14 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:42,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:12:42,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 341 [2023-01-28 11:12:42,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:12:42,672 INFO L130 PetriNetUnfolder]: 866/1245 cut-off events. [2023-01-28 11:12:42,673 INFO L131 PetriNetUnfolder]: For 854/879 co-relation queries the response was YES. [2023-01-28 11:12:42,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3613 conditions, 1245 events. 866/1245 cut-off events. For 854/879 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5045 event pairs, 330 based on Foata normal form. 25/1202 useless extension candidates. Maximal degree in co-relation 3135. Up to 795 conditions per place. [2023-01-28 11:12:42,678 INFO L137 encePairwiseOnDemand]: 335/341 looper letters, 42 selfloop transitions, 4 changer transitions 26/73 dead transitions. [2023-01-28 11:12:42,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 421 flow [2023-01-28 11:12:42,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 11:12:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 11:12:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 984 transitions. [2023-01-28 11:12:42,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4122329283619606 [2023-01-28 11:12:42,680 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 984 transitions. [2023-01-28 11:12:42,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 984 transitions. [2023-01-28 11:12:42,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:12:42,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 984 transitions. [2023-01-28 11:12:42,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.57142857142858) internal successors, (984), 7 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:42,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:42,684 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:42,684 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 165 flow. Second operand 7 states and 984 transitions. [2023-01-28 11:12:42,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 421 flow [2023-01-28 11:12:42,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 412 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 11:12:42,686 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 140 flow [2023-01-28 11:12:42,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2023-01-28 11:12:42,687 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-01-28 11:12:42,687 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 140 flow [2023-01-28 11:12:42,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 134.28571428571428) internal successors, (1880), 14 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:42,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:12:42,688 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:12:42,694 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:12:42,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:42,893 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:12:42,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:12:42,893 INFO L85 PathProgramCache]: Analyzing trace with hash -8956289, now seen corresponding path program 2 times [2023-01-28 11:12:42,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:12:42,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389237912] [2023-01-28 11:12:42,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:42,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:12:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:12:42,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:12:42,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389237912] [2023-01-28 11:12:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389237912] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:42,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928530410] [2023-01-28 11:12:42,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 11:12:42,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:42,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:12:42,971 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:12:42,989 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:12:43,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:12:43,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:12:43,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-01-28 11:12:43,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:12:43,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:12:43,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:12:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:12:43,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928530410] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:43,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 11:12:43,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2023-01-28 11:12:43,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293978037] [2023-01-28 11:12:43,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:12:43,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 11:12:43,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:12:43,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 11:12:43,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-01-28 11:12:43,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 341 [2023-01-28 11:12:43,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:43,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:12:43,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 341 [2023-01-28 11:12:43,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:12:43,266 INFO L130 PetriNetUnfolder]: 751/1009 cut-off events. [2023-01-28 11:12:43,266 INFO L131 PetriNetUnfolder]: For 744/746 co-relation queries the response was YES. [2023-01-28 11:12:43,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3120 conditions, 1009 events. 751/1009 cut-off events. For 744/746 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3415 event pairs, 155 based on Foata normal form. 48/1056 useless extension candidates. Maximal degree in co-relation 3082. Up to 583 conditions per place. [2023-01-28 11:12:43,270 INFO L137 encePairwiseOnDemand]: 334/341 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2023-01-28 11:12:43,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 289 flow [2023-01-28 11:12:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 11:12:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 11:12:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 858 transitions. [2023-01-28 11:12:43,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2023-01-28 11:12:43,272 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 858 transitions. [2023-01-28 11:12:43,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 858 transitions. [2023-01-28 11:12:43,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:12:43,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 858 transitions. [2023-01-28 11:12:43,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:43,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:43,276 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:43,276 INFO L175 Difference]: Start difference. First operand has 54 places, 33 transitions, 140 flow. Second operand 6 states and 858 transitions. [2023-01-28 11:12:43,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 289 flow [2023-01-28 11:12:43,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 243 flow, removed 12 selfloop flow, removed 13 redundant places. [2023-01-28 11:12:43,279 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 144 flow [2023-01-28 11:12:43,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-01-28 11:12:43,279 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-01-28 11:12:43,279 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 144 flow [2023-01-28 11:12:43,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:43,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:12:43,280 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:12:43,286 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:12:43,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:43,484 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:12:43,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:12:43,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1381542472, now seen corresponding path program 2 times [2023-01-28 11:12:43,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:12:43,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507078334] [2023-01-28 11:12:43,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:43,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:12:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:43,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:12:43,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507078334] [2023-01-28 11:12:43,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507078334] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:43,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174994304] [2023-01-28 11:12:43,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 11:12:43,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:43,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:12:43,582 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:12:43,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 11:12:43,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:12:43,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:12:43,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-28 11:12:43,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:12:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:43,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:12:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:43,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174994304] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:43,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 11:12:43,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2023-01-28 11:12:43,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812296957] [2023-01-28 11:12:43,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:12:43,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 11:12:43,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:12:43,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 11:12:43,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-01-28 11:12:43,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 341 [2023-01-28 11:12:43,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 144 flow. Second operand has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:43,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:12:43,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 341 [2023-01-28 11:12:43,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:12:43,960 INFO L130 PetriNetUnfolder]: 947/1306 cut-off events. [2023-01-28 11:12:43,960 INFO L131 PetriNetUnfolder]: For 1389/1577 co-relation queries the response was YES. [2023-01-28 11:12:43,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3955 conditions, 1306 events. 947/1306 cut-off events. For 1389/1577 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4851 event pairs, 242 based on Foata normal form. 202/1419 useless extension candidates. Maximal degree in co-relation 3927. Up to 717 conditions per place. [2023-01-28 11:12:43,965 INFO L137 encePairwiseOnDemand]: 332/341 looper letters, 76 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2023-01-28 11:12:43,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 538 flow [2023-01-28 11:12:43,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 11:12:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 11:12:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1088 transitions. [2023-01-28 11:12:43,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2023-01-28 11:12:43,967 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1088 transitions. [2023-01-28 11:12:43,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1088 transitions. [2023-01-28 11:12:43,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:12:43,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1088 transitions. [2023-01-28 11:12:43,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:43,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 341.0) internal successors, (3069), 9 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:43,972 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 341.0) internal successors, (3069), 9 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:43,972 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 144 flow. Second operand 8 states and 1088 transitions. [2023-01-28 11:12:43,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 538 flow [2023-01-28 11:12:43,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 88 transitions, 533 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 11:12:43,974 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 208 flow [2023-01-28 11:12:43,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=208, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-01-28 11:12:43,974 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2023-01-28 11:12:43,974 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 208 flow [2023-01-28 11:12:43,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:43,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:12:43,975 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:12:43,982 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:12:44,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:44,180 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:12:44,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:12:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1520372626, now seen corresponding path program 3 times [2023-01-28 11:12:44,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:12:44,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880541623] [2023-01-28 11:12:44,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:44,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:12:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:12:44,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:12:44,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880541623] [2023-01-28 11:12:44,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880541623] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:44,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717371865] [2023-01-28 11:12:44,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 11:12:44,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:44,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:12:44,298 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:12:44,299 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:12:44,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 11:12:44,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:12:44,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-28 11:12:44,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:12:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:12:44,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:12:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:12:44,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717371865] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:44,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 11:12:44,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2023-01-28 11:12:44,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834149884] [2023-01-28 11:12:44,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:12:44,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 11:12:44,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:12:44,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 11:12:44,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-01-28 11:12:44,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 341 [2023-01-28 11:12:44,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 208 flow. Second operand has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:44,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:12:44,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 341 [2023-01-28 11:12:44,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:12:44,774 INFO L130 PetriNetUnfolder]: 1354/1861 cut-off events. [2023-01-28 11:12:44,775 INFO L131 PetriNetUnfolder]: For 2964/3192 co-relation queries the response was YES. [2023-01-28 11:12:44,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6699 conditions, 1861 events. 1354/1861 cut-off events. For 2964/3192 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7039 event pairs, 292 based on Foata normal form. 240/2100 useless extension candidates. Maximal degree in co-relation 6667. Up to 877 conditions per place. [2023-01-28 11:12:44,783 INFO L137 encePairwiseOnDemand]: 331/341 looper letters, 98 selfloop transitions, 28 changer transitions 0/127 dead transitions. [2023-01-28 11:12:44,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 127 transitions, 896 flow [2023-01-28 11:12:44,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 11:12:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 11:12:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1362 transitions. [2023-01-28 11:12:44,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3994134897360704 [2023-01-28 11:12:44,787 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1362 transitions. [2023-01-28 11:12:44,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1362 transitions. [2023-01-28 11:12:44,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:12:44,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1362 transitions. [2023-01-28 11:12:44,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 136.2) internal successors, (1362), 10 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:44,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 341.0) internal successors, (3751), 11 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:44,792 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 341.0) internal successors, (3751), 11 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:44,792 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 208 flow. Second operand 10 states and 1362 transitions. [2023-01-28 11:12:44,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 127 transitions, 896 flow [2023-01-28 11:12:44,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 127 transitions, 873 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 11:12:44,797 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 383 flow [2023-01-28 11:12:44,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=383, PETRI_PLACES=58, PETRI_TRANSITIONS=58} [2023-01-28 11:12:44,798 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2023-01-28 11:12:44,798 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 58 transitions, 383 flow [2023-01-28 11:12:44,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:44,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:12:44,799 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:12:44,806 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:12:45,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:45,004 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:12:45,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:12:45,005 INFO L85 PathProgramCache]: Analyzing trace with hash -259531838, now seen corresponding path program 4 times [2023-01-28 11:12:45,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:12:45,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284859833] [2023-01-28 11:12:45,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:45,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:12:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:45,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:12:45,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284859833] [2023-01-28 11:12:45,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284859833] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:45,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757907429] [2023-01-28 11:12:45,148 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 11:12:45,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:45,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:12:45,165 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:12:45,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-28 11:12:45,250 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 11:12:45,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:12:45,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-28 11:12:45,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:12:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:45,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:12:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:45,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757907429] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:12:45,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:12:45,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2023-01-28 11:12:45,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108210341] [2023-01-28 11:12:45,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:12:45,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-28 11:12:45,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:12:45,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-28 11:12:45,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-01-28 11:12:45,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 341 [2023-01-28 11:12:45,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 383 flow. Second operand has 18 states, 18 states have (on average 129.83333333333334) internal successors, (2337), 18 states have internal predecessors, (2337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:45,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:12:45,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 341 [2023-01-28 11:12:45,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:12:45,893 INFO L130 PetriNetUnfolder]: 1773/2440 cut-off events. [2023-01-28 11:12:45,893 INFO L131 PetriNetUnfolder]: For 6600/6898 co-relation queries the response was YES. [2023-01-28 11:12:45,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 2440 events. 1773/2440 cut-off events. For 6600/6898 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9975 event pairs, 316 based on Foata normal form. 312/2751 useless extension candidates. Maximal degree in co-relation 10429. Up to 1135 conditions per place. [2023-01-28 11:12:45,910 INFO L137 encePairwiseOnDemand]: 330/341 looper letters, 110 selfloop transitions, 51 changer transitions 0/162 dead transitions. [2023-01-28 11:12:45,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 162 transitions, 1330 flow [2023-01-28 11:12:45,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 11:12:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 11:12:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1373 transitions. [2023-01-28 11:12:45,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4026392961876833 [2023-01-28 11:12:45,913 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1373 transitions. [2023-01-28 11:12:45,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1373 transitions. [2023-01-28 11:12:45,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:12:45,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1373 transitions. [2023-01-28 11:12:45,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 137.3) internal successors, (1373), 10 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:45,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 341.0) internal successors, (3751), 11 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:45,919 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 341.0) internal successors, (3751), 11 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:45,919 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 383 flow. Second operand 10 states and 1373 transitions. [2023-01-28 11:12:45,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 162 transitions, 1330 flow [2023-01-28 11:12:45,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 162 transitions, 1269 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-01-28 11:12:45,933 INFO L231 Difference]: Finished difference. Result has 69 places, 90 transitions, 794 flow [2023-01-28 11:12:45,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=794, PETRI_PLACES=69, PETRI_TRANSITIONS=90} [2023-01-28 11:12:45,934 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 37 predicate places. [2023-01-28 11:12:45,935 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 90 transitions, 794 flow [2023-01-28 11:12:45,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 129.83333333333334) internal successors, (2337), 18 states have internal predecessors, (2337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:45,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:12:45,936 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:12:45,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-01-28 11:12:46,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:46,141 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:12:46,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:12:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash 111750626, now seen corresponding path program 5 times [2023-01-28 11:12:46,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:12:46,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522331362] [2023-01-28 11:12:46,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:46,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:12:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:12:46,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:12:46,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522331362] [2023-01-28 11:12:46,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522331362] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:46,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052102132] [2023-01-28 11:12:46,246 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 11:12:46,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:46,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:12:46,247 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:12:46,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-28 11:12:46,322 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:12:46,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:12:46,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 11:12:46,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:12:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 11:12:46,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:12:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 11:12:46,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052102132] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:12:46,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:12:46,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2023-01-28 11:12:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695064102] [2023-01-28 11:12:46,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:12:46,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-28 11:12:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:12:46,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-28 11:12:46,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-01-28 11:12:46,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 341 [2023-01-28 11:12:46,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 90 transitions, 794 flow. Second operand has 15 states, 15 states have (on average 124.86666666666666) internal successors, (1873), 15 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:46,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:12:46,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 341 [2023-01-28 11:12:46,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:12:47,162 INFO L130 PetriNetUnfolder]: 2124/2936 cut-off events. [2023-01-28 11:12:47,162 INFO L131 PetriNetUnfolder]: For 11245/11245 co-relation queries the response was YES. [2023-01-28 11:12:47,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14382 conditions, 2936 events. 2124/2936 cut-off events. For 11245/11245 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11868 event pairs, 72 based on Foata normal form. 16/2952 useless extension candidates. Maximal degree in co-relation 14340. Up to 1249 conditions per place. [2023-01-28 11:12:47,182 INFO L137 encePairwiseOnDemand]: 329/341 looper letters, 144 selfloop transitions, 105 changer transitions 0/249 dead transitions. [2023-01-28 11:12:47,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 249 transitions, 2475 flow [2023-01-28 11:12:47,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-01-28 11:12:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-01-28 11:12:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2095 transitions. [2023-01-28 11:12:47,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3839809384164223 [2023-01-28 11:12:47,187 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2095 transitions. [2023-01-28 11:12:47,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2095 transitions. [2023-01-28 11:12:47,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:12:47,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2095 transitions. [2023-01-28 11:12:47,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 130.9375) internal successors, (2095), 16 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:47,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 341.0) internal successors, (5797), 17 states have internal predecessors, (5797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:47,206 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 341.0) internal successors, (5797), 17 states have internal predecessors, (5797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:47,206 INFO L175 Difference]: Start difference. First operand has 69 places, 90 transitions, 794 flow. Second operand 16 states and 2095 transitions. [2023-01-28 11:12:47,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 249 transitions, 2475 flow [2023-01-28 11:12:47,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 249 transitions, 2432 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-01-28 11:12:47,236 INFO L231 Difference]: Finished difference. Result has 89 places, 149 transitions, 1706 flow [2023-01-28 11:12:47,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1706, PETRI_PLACES=89, PETRI_TRANSITIONS=149} [2023-01-28 11:12:47,237 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 57 predicate places. [2023-01-28 11:12:47,237 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 149 transitions, 1706 flow [2023-01-28 11:12:47,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 124.86666666666666) internal successors, (1873), 15 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:47,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:12:47,238 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:12:47,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-28 11:12:47,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-01-28 11:12:47,443 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:12:47,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:12:47,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2132688008, now seen corresponding path program 6 times [2023-01-28 11:12:47,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:12:47,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875571013] [2023-01-28 11:12:47,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:47,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:12:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:12:47,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:12:47,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875571013] [2023-01-28 11:12:47,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875571013] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:47,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12543817] [2023-01-28 11:12:47,569 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 11:12:47,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:47,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:12:47,577 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:12:47,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-28 11:12:47,674 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-28 11:12:47,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:12:47,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-28 11:12:47,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:12:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:12:47,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:12:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:12:47,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12543817] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:47,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 11:12:47,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2023-01-28 11:12:47,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233359793] [2023-01-28 11:12:47,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:12:47,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 11:12:47,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:12:47,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 11:12:47,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-01-28 11:12:47,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 341 [2023-01-28 11:12:47,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 149 transitions, 1706 flow. Second operand has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:47,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:12:47,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 341 [2023-01-28 11:12:47,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:12:48,196 INFO L130 PetriNetUnfolder]: 2056/2828 cut-off events. [2023-01-28 11:12:48,196 INFO L131 PetriNetUnfolder]: For 13548/13666 co-relation queries the response was YES. [2023-01-28 11:12:48,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15149 conditions, 2828 events. 2056/2828 cut-off events. For 13548/13666 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11377 event pairs, 270 based on Foata normal form. 132/2960 useless extension candidates. Maximal degree in co-relation 15098. Up to 1119 conditions per place. [2023-01-28 11:12:48,212 INFO L137 encePairwiseOnDemand]: 331/341 looper letters, 130 selfloop transitions, 71 changer transitions 0/207 dead transitions. [2023-01-28 11:12:48,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 207 transitions, 2433 flow [2023-01-28 11:12:48,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 11:12:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 11:12:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1233 transitions. [2023-01-28 11:12:48,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40175953079178883 [2023-01-28 11:12:48,215 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1233 transitions. [2023-01-28 11:12:48,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1233 transitions. [2023-01-28 11:12:48,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:12:48,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1233 transitions. [2023-01-28 11:12:48,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:48,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:48,219 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:48,219 INFO L175 Difference]: Start difference. First operand has 89 places, 149 transitions, 1706 flow. Second operand 9 states and 1233 transitions. [2023-01-28 11:12:48,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 207 transitions, 2433 flow [2023-01-28 11:12:48,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 207 transitions, 2400 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-01-28 11:12:48,254 INFO L231 Difference]: Finished difference. Result has 96 places, 151 transitions, 1893 flow [2023-01-28 11:12:48,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1893, PETRI_PLACES=96, PETRI_TRANSITIONS=151} [2023-01-28 11:12:48,255 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 64 predicate places. [2023-01-28 11:12:48,255 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 151 transitions, 1893 flow [2023-01-28 11:12:48,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:48,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:12:48,255 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:12:48,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-28 11:12:48,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:48,460 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:12:48,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:12:48,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1095595526, now seen corresponding path program 7 times [2023-01-28 11:12:48,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:12:48,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85993042] [2023-01-28 11:12:48,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:48,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:12:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:12:48,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:12:48,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85993042] [2023-01-28 11:12:48,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85993042] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:48,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634438699] [2023-01-28 11:12:48,581 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 11:12:48,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:48,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:12:48,582 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:12:48,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-28 11:12:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:48,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-28 11:12:48,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:12:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:12:48,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:12:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:12:48,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634438699] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:48,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 11:12:48,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2023-01-28 11:12:48,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293824748] [2023-01-28 11:12:48,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:12:48,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 11:12:48,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:12:48,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 11:12:48,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-01-28 11:12:48,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 341 [2023-01-28 11:12:48,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 151 transitions, 1893 flow. Second operand has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:48,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:12:48,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 341 [2023-01-28 11:12:48,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:12:49,225 INFO L130 PetriNetUnfolder]: 2020/2772 cut-off events. [2023-01-28 11:12:49,225 INFO L131 PetriNetUnfolder]: For 16622/16734 co-relation queries the response was YES. [2023-01-28 11:12:49,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15837 conditions, 2772 events. 2020/2772 cut-off events. For 16622/16734 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10995 event pairs, 302 based on Foata normal form. 126/2898 useless extension candidates. Maximal degree in co-relation 15783. Up to 1096 conditions per place. [2023-01-28 11:12:49,241 INFO L137 encePairwiseOnDemand]: 331/341 looper letters, 95 selfloop transitions, 102 changer transitions 0/203 dead transitions. [2023-01-28 11:12:49,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 203 transitions, 2568 flow [2023-01-28 11:12:49,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 11:12:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 11:12:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1228 transitions. [2023-01-28 11:12:49,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4001303356142066 [2023-01-28 11:12:49,243 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1228 transitions. [2023-01-28 11:12:49,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1228 transitions. [2023-01-28 11:12:49,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:12:49,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1228 transitions. [2023-01-28 11:12:49,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 136.44444444444446) internal successors, (1228), 9 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:49,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:49,248 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:49,248 INFO L175 Difference]: Start difference. First operand has 96 places, 151 transitions, 1893 flow. Second operand 9 states and 1228 transitions. [2023-01-28 11:12:49,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 203 transitions, 2568 flow [2023-01-28 11:12:49,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 203 transitions, 2553 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-01-28 11:12:49,289 INFO L231 Difference]: Finished difference. Result has 103 places, 153 transitions, 2192 flow [2023-01-28 11:12:49,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2192, PETRI_PLACES=103, PETRI_TRANSITIONS=153} [2023-01-28 11:12:49,290 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 71 predicate places. [2023-01-28 11:12:49,290 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 153 transitions, 2192 flow [2023-01-28 11:12:49,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:49,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:12:49,290 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:12:49,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-01-28 11:12:49,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-01-28 11:12:49,495 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:12:49,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:12:49,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1081782259, now seen corresponding path program 1 times [2023-01-28 11:12:49,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:12:49,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301858149] [2023-01-28 11:12:49,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:49,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:12:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 11:12:49,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:12:49,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301858149] [2023-01-28 11:12:49,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301858149] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:12:49,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:12:49,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 11:12:49,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341314909] [2023-01-28 11:12:49,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:12:49,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 11:12:49,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:12:49,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 11:12:49,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 11:12:49,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-01-28 11:12:49,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 153 transitions, 2192 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:49,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:12:49,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-01-28 11:12:49,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:12:49,774 INFO L130 PetriNetUnfolder]: 1876/2602 cut-off events. [2023-01-28 11:12:49,774 INFO L131 PetriNetUnfolder]: For 25072/25806 co-relation queries the response was YES. [2023-01-28 11:12:49,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16315 conditions, 2602 events. 1876/2602 cut-off events. For 25072/25806 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 11346 event pairs, 464 based on Foata normal form. 436/2943 useless extension candidates. Maximal degree in co-relation 16258. Up to 1644 conditions per place. [2023-01-28 11:12:49,789 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 166 selfloop transitions, 3 changer transitions 0/194 dead transitions. [2023-01-28 11:12:49,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 194 transitions, 3059 flow [2023-01-28 11:12:49,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 11:12:49,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 11:12:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2023-01-28 11:12:49,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49266862170087977 [2023-01-28 11:12:49,791 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2023-01-28 11:12:49,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2023-01-28 11:12:49,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:12:49,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2023-01-28 11:12:49,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:49,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:49,793 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:49,793 INFO L175 Difference]: Start difference. First operand has 103 places, 153 transitions, 2192 flow. Second operand 3 states and 504 transitions. [2023-01-28 11:12:49,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 194 transitions, 3059 flow [2023-01-28 11:12:49,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 194 transitions, 2924 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-01-28 11:12:49,828 INFO L231 Difference]: Finished difference. Result has 100 places, 153 transitions, 2093 flow [2023-01-28 11:12:49,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2075, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2093, PETRI_PLACES=100, PETRI_TRANSITIONS=153} [2023-01-28 11:12:49,829 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 68 predicate places. [2023-01-28 11:12:49,830 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 153 transitions, 2093 flow [2023-01-28 11:12:49,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:12:49,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:12:49,830 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:12:49,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 11:12:49,830 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:12:49,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:12:49,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2072266448, now seen corresponding path program 1 times [2023-01-28 11:12:49,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:12:49,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705966537] [2023-01-28 11:12:49,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:49,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:12:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:52,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:12:52,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705966537] [2023-01-28 11:12:52,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705966537] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:12:52,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598816737] [2023-01-28 11:12:52,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:12:52,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:12:52,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:12:52,129 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:12:52,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-28 11:12:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:12:52,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 51 conjunts are in the unsatisfiable core [2023-01-28 11:12:52,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:12:52,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 11:12:52,486 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:12:52,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:12:52,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 11:12:52,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:12:52,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 11:12:53,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:12:53,095 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:12:53,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 52 [2023-01-28 11:12:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:12:53,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:12:54,459 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~A~0.offset 4 (* c_thread1Thread1of1ForFork0_~i~0 4))) (.cse10 (* 4 c_~M~0))) (let ((.cse1 (= (mod c_~sorted3~0 256) 0)) (.cse2 (<= c_~N~0 (+ c_~M~0 1))) (.cse3 (< (+ 2 c_~M~0) c_~N~0)) (.cse8 (+ c_~A~0.offset .cse10)) (.cse7 (+ c_~A~0.offset .cse10 4)) (.cse4 (= (mod c_~sorted2~0 256) 0)) (.cse0 (forall ((v_ArrVal_587 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base) .cse6) |c_thread1Thread1of1ForFork0_#t~mem2|)))) (and (or .cse0 (not .cse1) .cse2 .cse3) (or .cse1 .cse2 .cse3 .cse4 (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (or (< |c_thread1Thread1of1ForFork0_#t~mem2| (select .cse5 .cse6)) (<= (select .cse5 .cse7) (select .cse5 .cse8)))))) (or .cse2 .cse3 (and (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (or (<= (select .cse9 .cse6) |c_thread1Thread1of1ForFork0_#t~mem2|) (< (select .cse9 .cse8) (select .cse9 .cse7))))) (or (not .cse4) .cse0)))))) is different from false [2023-01-28 11:12:59,690 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((~M~0 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_585))) (let ((.cse0 (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 ~M~0) (let ((.cse1 (* ~M~0 4))) (< (select .cse0 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse0 (+ .cse1 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (+ 2 ~M~0) c_~N~0) (<= (select .cse0 .cse2) (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= c_~N~0 (+ ~M~0 1)))))) (forall ((~M~0 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_585))) (let ((.cse5 (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 ~M~0) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse5 .cse2)) (< (+ 2 ~M~0) c_~N~0) (let ((.cse6 (* ~M~0 4))) (<= (select .cse5 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse5 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (<= c_~N~0 (+ ~M~0 1)))))))) is different from false [2023-01-28 11:12:59,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:12:59,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 76 [2023-01-28 11:12:59,746 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-01-28 11:12:59,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 515 treesize of output 480 [2023-01-28 11:12:59,776 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-01-28 11:12:59,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 314 treesize of output 254 [2023-01-28 11:12:59,795 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-01-28 11:12:59,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 220 [2023-01-28 11:12:59,832 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-01-28 11:12:59,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 119 [2023-01-28 11:13:00,289 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 11:13:00,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 1 [2023-01-28 11:13:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-01-28 11:13:00,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598816737] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:13:00,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:13:00,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 41 [2023-01-28 11:13:00,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781096321] [2023-01-28 11:13:00,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:13:00,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-01-28 11:13:00,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:13:00,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-01-28 11:13:00,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1463, Unknown=14, NotChecked=158, Total=1806 [2023-01-28 11:13:00,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 341 [2023-01-28 11:13:00,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 153 transitions, 2093 flow. Second operand has 43 states, 43 states have (on average 86.74418604651163) internal successors, (3730), 43 states have internal predecessors, (3730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:13:00,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:13:00,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 341 [2023-01-28 11:13:00,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:13:13,864 WARN L222 SmtUtils]: Spent 8.75s on a formula simplification. DAG size of input: 123 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:13:22,527 WARN L222 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 136 DAG size of output: 105 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:13:53,343 WARN L222 SmtUtils]: Spent 27.75s on a formula simplification. DAG size of input: 101 DAG size of output: 89 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:14:02,197 WARN L222 SmtUtils]: Spent 8.61s on a formula simplification. DAG size of input: 143 DAG size of output: 111 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:14:36,257 WARN L222 SmtUtils]: Spent 28.02s on a formula simplification. DAG size of input: 112 DAG size of output: 100 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:15:24,315 WARN L222 SmtUtils]: Spent 27.91s on a formula simplification. DAG size of input: 127 DAG size of output: 115 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:15:46,970 WARN L222 SmtUtils]: Spent 16.11s on a formula simplification. DAG size of input: 162 DAG size of output: 130 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:16:19,858 WARN L222 SmtUtils]: Spent 32.64s on a formula simplification. DAG size of input: 138 DAG size of output: 126 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:16:36,712 WARN L222 SmtUtils]: Spent 10.93s on a formula simplification. DAG size of input: 117 DAG size of output: 100 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:16:43,844 WARN L222 SmtUtils]: Spent 6.84s on a formula simplification. DAG size of input: 195 DAG size of output: 126 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:17:07,362 WARN L222 SmtUtils]: Spent 23.11s on a formula simplification. DAG size of input: 130 DAG size of output: 118 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:17:14,458 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:17:38,540 WARN L222 SmtUtils]: Spent 12.00s on a formula simplification. DAG size of input: 128 DAG size of output: 110 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:18:17,386 WARN L222 SmtUtils]: Spent 36.51s on a formula simplification. DAG size of input: 141 DAG size of output: 129 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:18:19,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:18:29,412 WARN L222 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 139 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:18:58,642 WARN L222 SmtUtils]: Spent 19.55s on a formula simplification. DAG size of input: 170 DAG size of output: 136 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:19:19,551 WARN L222 SmtUtils]: Spent 20.46s on a formula simplification. DAG size of input: 161 DAG size of output: 131 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:19:32,724 WARN L222 SmtUtils]: Spent 6.85s on a formula simplification. DAG size of input: 192 DAG size of output: 100 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:19:34,891 INFO L130 PetriNetUnfolder]: 6133/8833 cut-off events. [2023-01-28 11:19:34,891 INFO L131 PetriNetUnfolder]: For 70049/70049 co-relation queries the response was YES. [2023-01-28 11:19:34,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51119 conditions, 8833 events. 6133/8833 cut-off events. For 70049/70049 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 46620 event pairs, 121 based on Foata normal form. 7/8840 useless extension candidates. Maximal degree in co-relation 51063. Up to 3586 conditions per place. [2023-01-28 11:19:34,958 INFO L137 encePairwiseOnDemand]: 323/341 looper letters, 609 selfloop transitions, 505 changer transitions 42/1156 dead transitions. [2023-01-28 11:19:34,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 1156 transitions, 14436 flow [2023-01-28 11:19:34,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-01-28 11:19:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2023-01-28 11:19:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 7570 transitions. [2023-01-28 11:19:34,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2740668332066182 [2023-01-28 11:19:34,970 INFO L72 ComplementDD]: Start complementDD. Operand 81 states and 7570 transitions. [2023-01-28 11:19:34,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 7570 transitions. [2023-01-28 11:19:34,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:19:34,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 81 states and 7570 transitions. [2023-01-28 11:19:34,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 82 states, 81 states have (on average 93.45679012345678) internal successors, (7570), 81 states have internal predecessors, (7570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:19:35,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 82 states, 82 states have (on average 341.0) internal successors, (27962), 82 states have internal predecessors, (27962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:19:35,011 INFO L81 ComplementDD]: Finished complementDD. Result has 82 states, 82 states have (on average 341.0) internal successors, (27962), 82 states have internal predecessors, (27962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:19:35,012 INFO L175 Difference]: Start difference. First operand has 100 places, 153 transitions, 2093 flow. Second operand 81 states and 7570 transitions. [2023-01-28 11:19:35,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 1156 transitions, 14436 flow [2023-01-28 11:19:35,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 1156 transitions, 14427 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 11:19:35,200 INFO L231 Difference]: Finished difference. Result has 204 places, 646 transitions, 10231 flow [2023-01-28 11:19:35,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=81, PETRI_FLOW=10231, PETRI_PLACES=204, PETRI_TRANSITIONS=646} [2023-01-28 11:19:35,200 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 172 predicate places. [2023-01-28 11:19:35,200 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 646 transitions, 10231 flow [2023-01-28 11:19:35,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 86.74418604651163) internal successors, (3730), 43 states have internal predecessors, (3730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:19:35,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:19:35,201 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:19:35,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-28 11:19:35,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-28 11:19:35,407 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:19:35,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:19:35,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1236109612, now seen corresponding path program 2 times [2023-01-28 11:19:35,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:19:35,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278620190] [2023-01-28 11:19:35,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:19:35,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:19:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:19:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:19:37,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:19:37,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278620190] [2023-01-28 11:19:37,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278620190] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:19:37,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083995370] [2023-01-28 11:19:37,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 11:19:37,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:19:37,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:19:37,172 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:19:37,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-28 11:19:37,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:19:37,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:19:37,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 11:19:37,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:19:37,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:19:38,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:19:38,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 52 [2023-01-28 11:19:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:19:38,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:19:39,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:19:39,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 79 [2023-01-28 11:19:39,390 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-01-28 11:19:39,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 1 [2023-01-28 11:19:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:19:39,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083995370] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:19:39,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:19:39,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2023-01-28 11:19:39,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581190300] [2023-01-28 11:19:39,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:19:39,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-28 11:19:39,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:19:39,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-28 11:19:39,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2023-01-28 11:19:39,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 341 [2023-01-28 11:19:39,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 646 transitions, 10231 flow. Second operand has 38 states, 38 states have (on average 96.97368421052632) internal successors, (3685), 38 states have internal predecessors, (3685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:19:39,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:19:39,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 341 [2023-01-28 11:19:39,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:20:03,667 INFO L130 PetriNetUnfolder]: 12320/17724 cut-off events. [2023-01-28 11:20:03,667 INFO L131 PetriNetUnfolder]: For 180393/180393 co-relation queries the response was YES. [2023-01-28 11:20:03,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117498 conditions, 17724 events. 12320/17724 cut-off events. For 180393/180393 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 102300 event pairs, 154 based on Foata normal form. 386/18110 useless extension candidates. Maximal degree in co-relation 117413. Up to 6989 conditions per place. [2023-01-28 11:20:03,817 INFO L137 encePairwiseOnDemand]: 322/341 looper letters, 823 selfloop transitions, 1275 changer transitions 51/2149 dead transitions. [2023-01-28 11:20:03,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 2149 transitions, 31039 flow [2023-01-28 11:20:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-01-28 11:20:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2023-01-28 11:20:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 10792 transitions. [2023-01-28 11:20:03,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3102754298200219 [2023-01-28 11:20:03,834 INFO L72 ComplementDD]: Start complementDD. Operand 102 states and 10792 transitions. [2023-01-28 11:20:03,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 10792 transitions. [2023-01-28 11:20:03,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:20:03,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 102 states and 10792 transitions. [2023-01-28 11:20:03,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 103 states, 102 states have (on average 105.80392156862744) internal successors, (10792), 102 states have internal predecessors, (10792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:20:03,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 103 states, 103 states have (on average 341.0) internal successors, (35123), 103 states have internal predecessors, (35123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:20:03,871 INFO L81 ComplementDD]: Finished complementDD. Result has 103 states, 103 states have (on average 341.0) internal successors, (35123), 103 states have internal predecessors, (35123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:20:03,871 INFO L175 Difference]: Start difference. First operand has 204 places, 646 transitions, 10231 flow. Second operand 102 states and 10792 transitions. [2023-01-28 11:20:03,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 2149 transitions, 31039 flow [2023-01-28 11:20:04,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 2149 transitions, 28973 flow, removed 980 selfloop flow, removed 4 redundant places. [2023-01-28 11:20:04,674 INFO L231 Difference]: Finished difference. Result has 356 places, 1489 transitions, 24596 flow [2023-01-28 11:20:04,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=8018, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=449, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=102, PETRI_FLOW=24596, PETRI_PLACES=356, PETRI_TRANSITIONS=1489} [2023-01-28 11:20:04,675 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 324 predicate places. [2023-01-28 11:20:04,675 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 1489 transitions, 24596 flow [2023-01-28 11:20:04,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 96.97368421052632) internal successors, (3685), 38 states have internal predecessors, (3685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:20:04,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:20:04,676 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:20:04,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-01-28 11:20:04,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-28 11:20:04,880 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:20:04,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:20:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1304888468, now seen corresponding path program 3 times [2023-01-28 11:20:04,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:20:04,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804106302] [2023-01-28 11:20:04,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:20:04,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:20:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:20:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:20:06,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:20:06,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804106302] [2023-01-28 11:20:06,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804106302] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:20:06,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347425449] [2023-01-28 11:20:06,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 11:20:06,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:20:06,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:20:06,544 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:20:06,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-28 11:20:06,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 11:20:06,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:20:06,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 50 conjunts are in the unsatisfiable core [2023-01-28 11:20:06,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:20:06,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 11:20:06,797 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:20:06,849 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:20:06,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:20:06,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 11:20:07,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:20:07,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:20:07,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 52 [2023-01-28 11:20:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:20:07,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:20:11,047 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse0 (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_84 Int)) (or (let ((.cse1 (* v_thread3Thread1of1ForFork2_~i~2_84 4))) (< (select .cse0 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse0 (+ .cse1 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (+ v_thread3Thread1of1ForFork2_~i~2_84 2) c_~N~0) (<= c_~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_84 1)) (< 0 v_thread3Thread1of1ForFork2_~i~2_84))) (<= (select .cse0 .cse2) (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_thread3Thread1of1ForFork2_~i~2_84 Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse5 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_84 2) c_~N~0) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse5 .cse2)) (<= c_~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_84 1)) (let ((.cse6 (* v_thread3Thread1of1ForFork2_~i~2_84 4))) (<= (select .cse5 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse5 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< 0 v_thread3Thread1of1ForFork2_~i~2_84))))))) is different from false [2023-01-28 11:20:11,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:20:11,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 79 [2023-01-28 11:20:11,113 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-01-28 11:20:11,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 823 treesize of output 776 [2023-01-28 11:20:11,151 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-01-28 11:20:11,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 318 treesize of output 258 [2023-01-28 11:20:11,189 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-01-28 11:20:11,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 250 treesize of output 234 [2023-01-28 11:20:11,231 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-01-28 11:20:11,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 119 [2023-01-28 11:20:11,843 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 11:20:11,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 1 [2023-01-28 11:20:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-01-28 11:20:11,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347425449] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:20:11,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:20:11,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 38 [2023-01-28 11:20:11,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792793770] [2023-01-28 11:20:11,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:20:11,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-01-28 11:20:11,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:20:11,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-01-28 11:20:11,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1311, Unknown=13, NotChecked=74, Total=1560 [2023-01-28 11:20:11,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 341 [2023-01-28 11:20:11,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 1489 transitions, 24596 flow. Second operand has 40 states, 40 states have (on average 86.825) internal successors, (3473), 40 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:20:11,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:20:11,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 341 [2023-01-28 11:20:11,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:20:19,688 WARN L222 SmtUtils]: Spent 7.47s on a formula simplification. DAG size of input: 201 DAG size of output: 147 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:20:42,601 WARN L222 SmtUtils]: Spent 8.15s 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:20:53,834 WARN L222 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 146 DAG size of output: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:21:02,834 WARN L222 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:21:14,645 WARN L222 SmtUtils]: Spent 11.53s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:21:36,758 WARN L222 SmtUtils]: Spent 13.42s on a formula simplification that was a NOOP. DAG size: 130 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:22:04,840 WARN L222 SmtUtils]: Spent 7.53s on a formula simplification. DAG size of input: 124 DAG size of output: 121 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:22:20,315 WARN L222 SmtUtils]: Spent 9.54s on a formula simplification. DAG size of input: 148 DAG size of output: 101 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:22:48,188 WARN L222 SmtUtils]: Spent 21.29s on a formula simplification. DAG size of input: 140 DAG size of output: 124 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:23:20,896 WARN L222 SmtUtils]: Spent 31.98s on a formula simplification. DAG size of input: 137 DAG size of output: 134 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:23:44,531 WARN L222 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 211 DAG size of output: 134 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:23:57,415 WARN L222 SmtUtils]: Spent 12.43s on a formula simplification. DAG size of input: 153 DAG size of output: 134 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:24:27,879 WARN L222 SmtUtils]: Spent 28.42s on a formula simplification. DAG size of input: 155 DAG size of output: 152 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:24:34,095 WARN L222 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 135 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:24:39,974 WARN L222 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 160 DAG size of output: 131 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:24:56,621 WARN L222 SmtUtils]: Spent 11.24s on a formula simplification that was a NOOP. DAG size: 148 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:25:10,440 WARN L222 SmtUtils]: Spent 7.09s on a formula simplification. DAG size of input: 224 DAG size of output: 146 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:25:35,024 WARN L222 SmtUtils]: Spent 19.13s on a formula simplification. DAG size of input: 168 DAG size of output: 165 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:25:43,854 WARN L222 SmtUtils]: Spent 7.45s on a formula simplification. DAG size of input: 177 DAG size of output: 111 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:26:23,812 WARN L222 SmtUtils]: Spent 9.77s on a formula simplification that was a NOOP. DAG size: 161 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:26:50,386 WARN L222 SmtUtils]: Spent 9.81s on a formula simplification. DAG size of input: 152 DAG size of output: 105 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:26:59,871 WARN L222 SmtUtils]: Spent 8.99s on a formula simplification. DAG size of input: 113 DAG size of output: 103 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-01-28 11:27:03,275 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:27:03,275 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 11:27:04,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-01-28 11:27:04,476 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:27:04,557 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:27:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2023-01-28 11:27:04,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 11:27:04,558 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:236) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:483) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.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:27:04,561 INFO L158 Benchmark]: Toolchain (without parser) took 870521.82ms. Allocated memory was 604.0MB in the beginning and 1.3GB in the end (delta: 654.3MB). Free memory was 564.9MB in the beginning and 756.9MB in the end (delta: -192.0MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-01-28 11:27:04,561 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 364.9MB. Free memory is still 313.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 11:27:04,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.11ms. Allocated memory is still 604.0MB. Free memory was 564.5MB in the beginning and 553.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-28 11:27:04,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.62ms. Allocated memory is still 604.0MB. Free memory was 553.0MB in the beginning and 551.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 11:27:04,562 INFO L158 Benchmark]: Boogie Preprocessor took 18.47ms. Allocated memory is still 604.0MB. Free memory was 551.0MB in the beginning and 549.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 11:27:04,562 INFO L158 Benchmark]: RCFGBuilder took 469.13ms. Allocated memory is still 604.0MB. Free memory was 549.5MB in the beginning and 531.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-01-28 11:27:04,562 INFO L158 Benchmark]: TraceAbstraction took 869770.48ms. Allocated memory was 604.0MB in the beginning and 1.3GB in the end (delta: 654.3MB). Free memory was 531.0MB in the beginning and 756.9MB in the end (delta: -225.9MB). Peak memory consumption was 967.2MB. Max. memory is 16.0GB. [2023-01-28 11:27:04,563 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 364.9MB. Free memory is still 313.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 228.11ms. Allocated memory is still 604.0MB. Free memory was 564.5MB in the beginning and 553.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 31.62ms. Allocated memory is still 604.0MB. Free memory was 553.0MB in the beginning and 551.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 18.47ms. Allocated memory is still 604.0MB. Free memory was 551.0MB in the beginning and 549.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 469.13ms. Allocated memory is still 604.0MB. Free memory was 549.5MB in the beginning and 531.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 869770.48ms. Allocated memory was 604.0MB in the beginning and 1.3GB in the end (delta: 654.3MB). Free memory was 531.0MB in the beginning and 756.9MB in the end (delta: -225.9MB). Peak memory consumption was 967.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 157 PlacesBefore, 32 PlacesAfterwards, 162 TransitionsBefore, 28 TransitionsAfterwards, 3534 CoEnabledTransitionPairs, 7 FixpointIterations, 75 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 22 ConcurrentYvCompositions, 9 ChoiceCompositions, 166 TotalNumberOfCompositions, 4092 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3679, independent: 3638, independent conditional: 0, independent unconditional: 3638, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2053, independent: 2038, independent conditional: 0, independent unconditional: 2038, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3679, independent: 1600, independent conditional: 0, independent unconditional: 1600, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 2053, unknown conditional: 0, unknown unconditional: 2053] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown