/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 BEFORE -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 04:55:13,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 04:55:13,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 04:55:13,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 04:55:13,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 04:55:13,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 04:55:13,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 04:55:13,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 04:55:13,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 04:55:13,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 04:55:13,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 04:55:13,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 04:55:13,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 04:55:13,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 04:55:13,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 04:55:13,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 04:55:13,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 04:55:13,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 04:55:13,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 04:55:13,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 04:55:13,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 04:55:13,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 04:55:13,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 04:55:13,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 04:55:13,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 04:55:13,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 04:55:13,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 04:55:13,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 04:55:13,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 04:55:13,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 04:55:13,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 04:55:13,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 04:55:13,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 04:55:13,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 04:55:13,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 04:55:13,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 04:55:13,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 04:55:13,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 04:55:13,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 04:55:13,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 04:55:13,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 04:55:13,481 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 04:55:13,500 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 04:55:13,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 04:55:13,501 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 04:55:13,501 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 04:55:13,502 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 04:55:13,502 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 04:55:13,502 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 04:55:13,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 04:55:13,502 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 04:55:13,502 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 04:55:13,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 04:55:13,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 04:55:13,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 04:55:13,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 04:55:13,503 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 04:55:13,503 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 04:55:13,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 04:55:13,504 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 04:55:13,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 04:55:13,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 04:55:13,504 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 04:55:13,504 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 04:55:13,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 04:55:13,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 04:55:13,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 04:55:13,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 04:55:13,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 04:55:13,504 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 04:55:13,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 04:55:13,505 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 04:55:13,505 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 04:55:13,505 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 -> BEFORE [2023-01-28 04:55:13,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 04:55:13,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 04:55:13,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 04:55:13,693 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 04:55:13,695 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 04:55:13,695 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 04:55:14,776 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 04:55:14,917 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 04:55:14,917 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2023-01-28 04:55:14,921 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18213dab6/9ff8b889b2804f6180f34ccf0c61ecb7/FLAGe2b137f3b [2023-01-28 04:55:14,929 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18213dab6/9ff8b889b2804f6180f34ccf0c61ecb7 [2023-01-28 04:55:14,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 04:55:14,932 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 04:55:14,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 04:55:14,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 04:55:14,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 04:55:14,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 04:55:14" (1/1) ... [2023-01-28 04:55:14,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dbe6fcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:55:14, skipping insertion in model container [2023-01-28 04:55:14,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 04:55:14" (1/1) ... [2023-01-28 04:55:14,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 04:55:14,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 04:55:15,082 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 04:55:15,087 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 04:55:15,092 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 04:55:15,105 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 04:55:15,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 04:55:15,115 INFO L208 MainTranslator]: Completed translation [2023-01-28 04:55:15,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:55:15 WrapperNode [2023-01-28 04:55:15,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 04:55:15,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 04:55:15,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 04:55:15,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 04:55:15,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:55:15" (1/1) ... [2023-01-28 04:55:15,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:55:15" (1/1) ... [2023-01-28 04:55:15,149 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 108 [2023-01-28 04:55:15,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 04:55:15,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 04:55:15,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 04:55:15,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 04:55:15,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:55:15" (1/1) ... [2023-01-28 04:55:15,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:55:15" (1/1) ... [2023-01-28 04:55:15,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:55:15" (1/1) ... [2023-01-28 04:55:15,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:55:15" (1/1) ... [2023-01-28 04:55:15,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:55:15" (1/1) ... [2023-01-28 04:55:15,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:55:15" (1/1) ... [2023-01-28 04:55:15,164 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:55:15" (1/1) ... [2023-01-28 04:55:15,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:55:15" (1/1) ... [2023-01-28 04:55:15,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 04:55:15,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 04:55:15,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 04:55:15,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 04:55:15,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:55:15" (1/1) ... [2023-01-28 04:55:15,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 04:55:15,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:55:15,203 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 04:55:15,207 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 04:55:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 04:55:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 04:55:15,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 04:55:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 04:55:15,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 04:55:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 04:55:15,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 04:55:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 04:55:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 04:55:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 04:55:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 04:55:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 04:55:15,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 04:55:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 04:55:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 04:55:15,260 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 04:55:15,349 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 04:55:15,351 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 04:55:15,633 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 04:55:15,639 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 04:55:15,639 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-28 04:55:15,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 04:55:15 BoogieIcfgContainer [2023-01-28 04:55:15,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 04:55:15,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 04:55:15,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 04:55:15,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 04:55:15,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 04:55:14" (1/3) ... [2023-01-28 04:55:15,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8234c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 04:55:15, skipping insertion in model container [2023-01-28 04:55:15,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:55:15" (2/3) ... [2023-01-28 04:55:15,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8234c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 04:55:15, skipping insertion in model container [2023-01-28 04:55:15,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 04:55:15" (3/3) ... [2023-01-28 04:55:15,655 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2023-01-28 04:55:15,665 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 04:55:15,665 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 04:55:15,665 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 04:55:15,715 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-28 04:55:15,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 175 transitions, 374 flow [2023-01-28 04:55:15,788 INFO L130 PetriNetUnfolder]: 15/172 cut-off events. [2023-01-28 04:55:15,788 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 04:55:15,794 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 04:55:15,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 175 transitions, 374 flow [2023-01-28 04:55:15,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 162 transitions, 342 flow [2023-01-28 04:55:15,799 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 04:55:15,805 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 162 transitions, 342 flow [2023-01-28 04:55:15,806 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 162 transitions, 342 flow [2023-01-28 04:55:15,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 162 transitions, 342 flow [2023-01-28 04:55:15,827 INFO L130 PetriNetUnfolder]: 15/162 cut-off events. [2023-01-28 04:55:15,827 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 04:55:15,828 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 04:55:15,830 INFO L119 LiptonReduction]: Number of co-enabled transitions 3534 [2023-01-28 04:55:20,293 INFO L134 LiptonReduction]: Checked pairs total: 4092 [2023-01-28 04:55:20,294 INFO L136 LiptonReduction]: Total number of compositions: 166 [2023-01-28 04:55:20,305 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 04:55:20,310 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;@5b5dd14e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 04:55:20,311 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 04:55:20,317 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2023-01-28 04:55:20,317 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 04:55:20,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:55:20,318 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 04:55:20,318 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 04:55:20,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:55:20,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1548535715, now seen corresponding path program 1 times [2023-01-28 04:55:20,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:55:20,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878717412] [2023-01-28 04:55:20,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:20,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:55:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:20,744 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 04:55:20,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:55:20,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878717412] [2023-01-28 04:55:20,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878717412] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:55:20,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:55:20,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 04:55:20,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488436706] [2023-01-28 04:55:20,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:55:20,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 04:55:20,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:55:20,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 04:55:20,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 04:55:20,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 341 [2023-01-28 04:55:20,777 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 04:55:20,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:55:20,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 341 [2023-01-28 04:55:20,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:55:20,909 INFO L130 PetriNetUnfolder]: 543/714 cut-off events. [2023-01-28 04:55:20,909 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-01-28 04:55:20,912 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 04:55:20,917 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 24 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-01-28 04:55:20,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 128 flow [2023-01-28 04:55:20,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 04:55:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 04:55:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-01-28 04:55:20,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4398826979472141 [2023-01-28 04:55:20,935 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-01-28 04:55:20,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-01-28 04:55:20,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:55:20,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-01-28 04:55:20,945 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 04:55:20,949 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 04:55:20,949 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 04:55:20,950 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 3 states and 450 transitions. [2023-01-28 04:55:20,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 128 flow [2023-01-28 04:55:20,954 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 04:55:20,955 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 74 flow [2023-01-28 04:55:20,956 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 04:55:20,958 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2023-01-28 04:55:20,958 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 74 flow [2023-01-28 04:55:20,959 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 04:55:20,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:55:20,959 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 04:55:20,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 04:55:20,959 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 04:55:20,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:55:20,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2004951010, now seen corresponding path program 1 times [2023-01-28 04:55:20,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:55:20,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472173984] [2023-01-28 04:55:20,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:20,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:55:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:21,346 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 04:55:21,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:55:21,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472173984] [2023-01-28 04:55:21,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472173984] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:55:21,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:55:21,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 04:55:21,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39622187] [2023-01-28 04:55:21,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:55:21,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 04:55:21,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:55:21,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 04:55:21,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 04:55:21,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 341 [2023-01-28 04:55:21,356 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 04:55:21,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:55:21,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 341 [2023-01-28 04:55:21,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:55:21,458 INFO L130 PetriNetUnfolder]: 753/1008 cut-off events. [2023-01-28 04:55:21,458 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-01-28 04:55:21,460 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 04:55:21,463 INFO L137 encePairwiseOnDemand]: 334/341 looper letters, 39 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2023-01-28 04:55:21,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 47 transitions, 203 flow [2023-01-28 04:55:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 04:55:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 04:55:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2023-01-28 04:55:21,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4760508308895406 [2023-01-28 04:55:21,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2023-01-28 04:55:21,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2023-01-28 04:55:21,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:55:21,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2023-01-28 04:55:21,466 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 04:55:21,469 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 04:55:21,469 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 04:55:21,469 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 74 flow. Second operand 3 states and 487 transitions. [2023-01-28 04:55:21,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 47 transitions, 203 flow [2023-01-28 04:55:21,470 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 04:55:21,471 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 100 flow [2023-01-28 04:55:21,471 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 04:55:21,471 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-01-28 04:55:21,471 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 100 flow [2023-01-28 04:55:21,472 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 04:55:21,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:55:21,472 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 04:55:21,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 04:55:21,472 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 04:55:21,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:55:21,474 INFO L85 PathProgramCache]: Analyzing trace with hash 610154948, now seen corresponding path program 1 times [2023-01-28 04:55:21,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:55:21,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724915123] [2023-01-28 04:55:21,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:21,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:55:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:21,619 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 04:55:21,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:55:21,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724915123] [2023-01-28 04:55:21,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724915123] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:21,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584946321] [2023-01-28 04:55:21,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:21,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:55:21,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:55:21,623 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 04:55:21,670 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 04:55:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:21,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 04:55:21,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:55:22,035 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 04:55:22,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:55:22,106 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 04:55:22,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584946321] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:55:22,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:55:22,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-28 04:55:22,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936818854] [2023-01-28 04:55:22,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:55:22,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 04:55:22,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:55:22,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 04:55:22,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-01-28 04:55:22,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 341 [2023-01-28 04:55:22,114 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 04:55:22,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:55:22,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 341 [2023-01-28 04:55:22,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:55:22,414 INFO L130 PetriNetUnfolder]: 1451/1990 cut-off events. [2023-01-28 04:55:22,414 INFO L131 PetriNetUnfolder]: For 456/458 co-relation queries the response was YES. [2023-01-28 04:55:22,417 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 04:55:22,425 INFO L137 encePairwiseOnDemand]: 335/341 looper letters, 80 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2023-01-28 04:55:22,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 88 transitions, 445 flow [2023-01-28 04:55:22,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 04:55:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 04:55:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1002 transitions. [2023-01-28 04:55:22,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4197737746124843 [2023-01-28 04:55:22,428 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1002 transitions. [2023-01-28 04:55:22,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1002 transitions. [2023-01-28 04:55:22,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:55:22,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1002 transitions. [2023-01-28 04:55:22,430 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 04:55:22,433 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 04:55:22,434 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 04:55:22,434 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 100 flow. Second operand 7 states and 1002 transitions. [2023-01-28 04:55:22,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 88 transitions, 445 flow [2023-01-28 04:55:22,436 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 04:55:22,437 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 143 flow [2023-01-28 04:55:22,437 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 04:55:22,438 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-01-28 04:55:22,438 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 143 flow [2023-01-28 04:55:22,439 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 04:55:22,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:55:22,439 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 04:55:22,448 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 04:55:22,649 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 04:55:22,650 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 04:55:22,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:55:22,651 INFO L85 PathProgramCache]: Analyzing trace with hash -141297123, now seen corresponding path program 1 times [2023-01-28 04:55:22,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:55:22,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095552731] [2023-01-28 04:55:22,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:22,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:55:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:22,774 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 04:55:22,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:55:22,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095552731] [2023-01-28 04:55:22,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095552731] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:22,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670999679] [2023-01-28 04:55:22,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:22,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:55:22,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:55:22,776 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 04:55:22,780 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 04:55:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:22,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-01-28 04:55:22,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:55:22,890 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 04:55:22,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:55:22,924 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 04:55:22,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670999679] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:55:22,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:55:22,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-28 04:55:22,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112529015] [2023-01-28 04:55:22,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:55:22,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 04:55:22,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:55:22,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 04:55:22,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-01-28 04:55:22,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 341 [2023-01-28 04:55:22,928 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 04:55:22,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:55:22,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 341 [2023-01-28 04:55:22,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:55:23,140 INFO L130 PetriNetUnfolder]: 942/1371 cut-off events. [2023-01-28 04:55:23,140 INFO L131 PetriNetUnfolder]: For 627/679 co-relation queries the response was YES. [2023-01-28 04:55:23,142 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 04:55:23,146 INFO L137 encePairwiseOnDemand]: 334/341 looper letters, 70 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2023-01-28 04:55:23,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 424 flow [2023-01-28 04:55:23,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 04:55:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 04:55:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1023 transitions. [2023-01-28 04:55:23,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-01-28 04:55:23,149 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1023 transitions. [2023-01-28 04:55:23,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1023 transitions. [2023-01-28 04:55:23,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:55:23,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1023 transitions. [2023-01-28 04:55:23,151 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 04:55:23,154 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 04:55:23,154 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 04:55:23,154 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 143 flow. Second operand 7 states and 1023 transitions. [2023-01-28 04:55:23,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 424 flow [2023-01-28 04:55:23,158 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 04:55:23,159 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 165 flow [2023-01-28 04:55:23,159 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 04:55:23,160 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2023-01-28 04:55:23,160 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 165 flow [2023-01-28 04:55:23,161 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 04:55:23,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:55:23,161 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 04:55:23,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-28 04:55:23,365 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 04:55:23,366 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 04:55:23,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:55:23,366 INFO L85 PathProgramCache]: Analyzing trace with hash -990089336, now seen corresponding path program 1 times [2023-01-28 04:55:23,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:55:23,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878649115] [2023-01-28 04:55:23,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:23,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:55:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:23,515 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 04:55:23,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:55:23,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878649115] [2023-01-28 04:55:23,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878649115] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:23,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648793909] [2023-01-28 04:55:23,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:23,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:55:23,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:55:23,517 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 04:55:23,537 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 04:55:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:23,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 04:55:23,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:55:23,693 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 04:55:23,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:55:23,743 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 04:55:23,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648793909] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:55:23,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:55:23,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-01-28 04:55:23,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989246973] [2023-01-28 04:55:23,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:55:23,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 04:55:23,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:55:23,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 04:55:23,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-01-28 04:55:23,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 341 [2023-01-28 04:55:23,747 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 04:55:23,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:55:23,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 341 [2023-01-28 04:55:23,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:55:24,008 INFO L130 PetriNetUnfolder]: 866/1245 cut-off events. [2023-01-28 04:55:24,008 INFO L131 PetriNetUnfolder]: For 854/879 co-relation queries the response was YES. [2023-01-28 04:55:24,010 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 04:55:24,014 INFO L137 encePairwiseOnDemand]: 335/341 looper letters, 42 selfloop transitions, 4 changer transitions 26/73 dead transitions. [2023-01-28 04:55:24,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 421 flow [2023-01-28 04:55:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 04:55:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 04:55:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 984 transitions. [2023-01-28 04:55:24,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4122329283619606 [2023-01-28 04:55:24,016 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 984 transitions. [2023-01-28 04:55:24,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 984 transitions. [2023-01-28 04:55:24,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:55:24,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 984 transitions. [2023-01-28 04:55:24,018 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 04:55:24,020 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 04:55:24,021 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 04:55:24,021 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 165 flow. Second operand 7 states and 984 transitions. [2023-01-28 04:55:24,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 421 flow [2023-01-28 04:55:24,022 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 04:55:24,023 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 140 flow [2023-01-28 04:55:24,023 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 04:55:24,024 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-01-28 04:55:24,024 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 140 flow [2023-01-28 04:55:24,025 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 04:55:24,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:55:24,025 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 04:55:24,030 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 04:55:24,229 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 04:55:24,230 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 04:55:24,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:55:24,230 INFO L85 PathProgramCache]: Analyzing trace with hash -8956289, now seen corresponding path program 2 times [2023-01-28 04:55:24,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:55:24,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126330243] [2023-01-28 04:55:24,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:24,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:55:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:24,334 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 04:55:24,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:55:24,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126330243] [2023-01-28 04:55:24,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126330243] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:24,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640736875] [2023-01-28 04:55:24,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 04:55:24,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:55:24,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:55:24,336 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 04:55:24,341 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 04:55:24,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 04:55:24,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:55:24,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-01-28 04:55:24,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:55:24,467 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 04:55:24,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:55:24,508 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 04:55:24,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640736875] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:24,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 04:55:24,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2023-01-28 04:55:24,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994679328] [2023-01-28 04:55:24,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:55:24,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 04:55:24,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:55:24,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 04:55:24,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-01-28 04:55:24,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 341 [2023-01-28 04:55:24,513 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 04:55:24,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:55:24,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 341 [2023-01-28 04:55:24,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:55:24,647 INFO L130 PetriNetUnfolder]: 751/1009 cut-off events. [2023-01-28 04:55:24,647 INFO L131 PetriNetUnfolder]: For 744/746 co-relation queries the response was YES. [2023-01-28 04:55:24,649 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 04:55:24,654 INFO L137 encePairwiseOnDemand]: 334/341 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2023-01-28 04:55:24,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 289 flow [2023-01-28 04:55:24,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 04:55:24,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 04:55:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 858 transitions. [2023-01-28 04:55:24,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2023-01-28 04:55:24,657 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 858 transitions. [2023-01-28 04:55:24,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 858 transitions. [2023-01-28 04:55:24,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:55:24,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 858 transitions. [2023-01-28 04:55:24,659 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 04:55:24,662 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 04:55:24,662 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 04:55:24,662 INFO L175 Difference]: Start difference. First operand has 54 places, 33 transitions, 140 flow. Second operand 6 states and 858 transitions. [2023-01-28 04:55:24,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 289 flow [2023-01-28 04:55:24,666 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 04:55:24,667 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 144 flow [2023-01-28 04:55:24,667 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 04:55:24,668 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-01-28 04:55:24,668 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 144 flow [2023-01-28 04:55:24,669 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 04:55:24,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:55:24,669 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 04:55:24,678 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 04:55:24,875 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 04:55:24,875 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 04:55:24,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:55:24,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1381542472, now seen corresponding path program 2 times [2023-01-28 04:55:24,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:55:24,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372855507] [2023-01-28 04:55:24,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:24,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:55:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:24,995 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 04:55:24,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:55:24,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372855507] [2023-01-28 04:55:24,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372855507] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:24,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559165306] [2023-01-28 04:55:24,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 04:55:24,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:55:24,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:55:24,997 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 04:55:24,999 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 04:55:25,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 04:55:25,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:55:25,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-28 04:55:25,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:55:25,153 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 04:55:25,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:55:25,209 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 04:55:25,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559165306] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:25,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 04:55:25,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2023-01-28 04:55:25,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100186410] [2023-01-28 04:55:25,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:55:25,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 04:55:25,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:55:25,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 04:55:25,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-01-28 04:55:25,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 341 [2023-01-28 04:55:25,211 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 04:55:25,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:55:25,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 341 [2023-01-28 04:55:25,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:55:25,388 INFO L130 PetriNetUnfolder]: 947/1306 cut-off events. [2023-01-28 04:55:25,389 INFO L131 PetriNetUnfolder]: For 1389/1577 co-relation queries the response was YES. [2023-01-28 04:55:25,390 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 04:55:25,394 INFO L137 encePairwiseOnDemand]: 332/341 looper letters, 76 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2023-01-28 04:55:25,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 538 flow [2023-01-28 04:55:25,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 04:55:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 04:55:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1088 transitions. [2023-01-28 04:55:25,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2023-01-28 04:55:25,397 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1088 transitions. [2023-01-28 04:55:25,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1088 transitions. [2023-01-28 04:55:25,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:55:25,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1088 transitions. [2023-01-28 04:55:25,399 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 04:55:25,401 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 04:55:25,402 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 04:55:25,402 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 144 flow. Second operand 8 states and 1088 transitions. [2023-01-28 04:55:25,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 538 flow [2023-01-28 04:55:25,403 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 04:55:25,403 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 208 flow [2023-01-28 04:55:25,404 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 04:55:25,404 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2023-01-28 04:55:25,404 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 208 flow [2023-01-28 04:55:25,405 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 04:55:25,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:55:25,405 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 04:55:25,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-01-28 04:55:25,609 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 04:55:25,609 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 04:55:25,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:55:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1520372626, now seen corresponding path program 3 times [2023-01-28 04:55:25,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:55:25,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714406986] [2023-01-28 04:55:25,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:25,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:55:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:25,730 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 04:55:25,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:55:25,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714406986] [2023-01-28 04:55:25,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714406986] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:25,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630603025] [2023-01-28 04:55:25,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 04:55:25,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:55:25,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:55:25,731 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 04:55:25,733 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 04:55:25,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 04:55:25,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:55:25,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-28 04:55:25,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:55:25,923 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 04:55:25,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:55:25,984 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 04:55:25,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630603025] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:25,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 04:55:25,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2023-01-28 04:55:25,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846590931] [2023-01-28 04:55:25,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:55:25,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 04:55:25,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:55:25,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 04:55:25,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-01-28 04:55:25,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 341 [2023-01-28 04:55:25,987 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 04:55:25,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:55:25,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 341 [2023-01-28 04:55:25,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:55:26,209 INFO L130 PetriNetUnfolder]: 1354/1861 cut-off events. [2023-01-28 04:55:26,209 INFO L131 PetriNetUnfolder]: For 2964/3192 co-relation queries the response was YES. [2023-01-28 04:55:26,211 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 04:55:26,218 INFO L137 encePairwiseOnDemand]: 331/341 looper letters, 98 selfloop transitions, 28 changer transitions 0/127 dead transitions. [2023-01-28 04:55:26,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 127 transitions, 896 flow [2023-01-28 04:55:26,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 04:55:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 04:55:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1362 transitions. [2023-01-28 04:55:26,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3994134897360704 [2023-01-28 04:55:26,221 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1362 transitions. [2023-01-28 04:55:26,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1362 transitions. [2023-01-28 04:55:26,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:55:26,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1362 transitions. [2023-01-28 04:55:26,223 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 04:55:26,226 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 04:55:26,226 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 04:55:26,226 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 208 flow. Second operand 10 states and 1362 transitions. [2023-01-28 04:55:26,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 127 transitions, 896 flow [2023-01-28 04:55:26,228 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 04:55:26,229 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 383 flow [2023-01-28 04:55:26,229 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 04:55:26,230 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2023-01-28 04:55:26,230 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 58 transitions, 383 flow [2023-01-28 04:55:26,230 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 04:55:26,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:55:26,230 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 04:55:26,237 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 04:55:26,435 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 04:55:26,435 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 04:55:26,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:55:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash -259531838, now seen corresponding path program 4 times [2023-01-28 04:55:26,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:55:26,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869798209] [2023-01-28 04:55:26,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:26,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:55:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:26,551 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 04:55:26,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:55:26,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869798209] [2023-01-28 04:55:26,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869798209] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:26,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248582583] [2023-01-28 04:55:26,552 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 04:55:26,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:55:26,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:55:26,553 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 04:55:26,555 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 04:55:26,629 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 04:55:26,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:55:26,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-28 04:55:26,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:55:26,711 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 04:55:26,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:55:26,782 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 04:55:26,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248582583] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:55:26,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:55:26,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2023-01-28 04:55:26,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420313666] [2023-01-28 04:55:26,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:55:26,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-28 04:55:26,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:55:26,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-28 04:55:26,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-01-28 04:55:26,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 341 [2023-01-28 04:55:26,787 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 04:55:26,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:55:26,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 341 [2023-01-28 04:55:26,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:55:27,238 INFO L130 PetriNetUnfolder]: 1773/2440 cut-off events. [2023-01-28 04:55:27,238 INFO L131 PetriNetUnfolder]: For 6600/6898 co-relation queries the response was YES. [2023-01-28 04:55:27,242 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 04:55:27,254 INFO L137 encePairwiseOnDemand]: 330/341 looper letters, 110 selfloop transitions, 51 changer transitions 0/162 dead transitions. [2023-01-28 04:55:27,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 162 transitions, 1330 flow [2023-01-28 04:55:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 04:55:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 04:55:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1373 transitions. [2023-01-28 04:55:27,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4026392961876833 [2023-01-28 04:55:27,257 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1373 transitions. [2023-01-28 04:55:27,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1373 transitions. [2023-01-28 04:55:27,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:55:27,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1373 transitions. [2023-01-28 04:55:27,260 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 04:55:27,262 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 04:55:27,263 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 04:55:27,263 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 383 flow. Second operand 10 states and 1373 transitions. [2023-01-28 04:55:27,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 162 transitions, 1330 flow [2023-01-28 04:55:27,275 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 04:55:27,277 INFO L231 Difference]: Finished difference. Result has 69 places, 90 transitions, 794 flow [2023-01-28 04:55:27,277 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 04:55:27,277 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 37 predicate places. [2023-01-28 04:55:27,277 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 90 transitions, 794 flow [2023-01-28 04:55:27,278 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 04:55:27,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:55:27,278 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 04:55:27,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-28 04:55:27,483 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 04:55:27,484 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 04:55:27,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:55:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash 111750626, now seen corresponding path program 5 times [2023-01-28 04:55:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:55:27,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20090441] [2023-01-28 04:55:27,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:27,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:55:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:27,628 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 04:55:27,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:55:27,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20090441] [2023-01-28 04:55:27,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20090441] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:27,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845680906] [2023-01-28 04:55:27,628 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 04:55:27,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:55:27,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:55:27,630 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 04:55:27,638 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 04:55:27,733 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 04:55:27,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:55:27,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 04:55:27,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:55:27,801 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 04:55:27,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:55:27,861 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 04:55:27,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845680906] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:55:27,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:55:27,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2023-01-28 04:55:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323720936] [2023-01-28 04:55:27,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:55:27,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-28 04:55:27,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:55:27,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-28 04:55:27,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-01-28 04:55:27,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 341 [2023-01-28 04:55:27,864 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 04:55:27,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:55:27,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 341 [2023-01-28 04:55:27,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:55:28,590 INFO L130 PetriNetUnfolder]: 2124/2936 cut-off events. [2023-01-28 04:55:28,591 INFO L131 PetriNetUnfolder]: For 11245/11245 co-relation queries the response was YES. [2023-01-28 04:55:28,598 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 04:55:28,612 INFO L137 encePairwiseOnDemand]: 329/341 looper letters, 144 selfloop transitions, 105 changer transitions 0/249 dead transitions. [2023-01-28 04:55:28,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 249 transitions, 2475 flow [2023-01-28 04:55:28,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-01-28 04:55:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-01-28 04:55:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2095 transitions. [2023-01-28 04:55:28,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3839809384164223 [2023-01-28 04:55:28,616 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2095 transitions. [2023-01-28 04:55:28,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2095 transitions. [2023-01-28 04:55:28,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:55:28,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2095 transitions. [2023-01-28 04:55:28,620 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 04:55:28,634 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 04:55:28,636 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 04:55:28,636 INFO L175 Difference]: Start difference. First operand has 69 places, 90 transitions, 794 flow. Second operand 16 states and 2095 transitions. [2023-01-28 04:55:28,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 249 transitions, 2475 flow [2023-01-28 04:55:28,659 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 04:55:28,661 INFO L231 Difference]: Finished difference. Result has 89 places, 149 transitions, 1706 flow [2023-01-28 04:55:28,662 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 04:55:28,663 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 57 predicate places. [2023-01-28 04:55:28,663 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 149 transitions, 1706 flow [2023-01-28 04:55:28,663 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 04:55:28,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:55:28,663 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 04:55:28,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-01-28 04:55:28,868 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 04:55:28,869 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 04:55:28,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:55:28,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2132688008, now seen corresponding path program 6 times [2023-01-28 04:55:28,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:55:28,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569189315] [2023-01-28 04:55:28,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:28,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:55:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:29,018 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 04:55:29,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:55:29,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569189315] [2023-01-28 04:55:29,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569189315] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:29,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067317106] [2023-01-28 04:55:29,018 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 04:55:29,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:55:29,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:55:29,024 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 04:55:29,053 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 04:55:29,148 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-28 04:55:29,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:55:29,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-28 04:55:29,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:55:29,239 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 04:55:29,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:55:29,321 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 04:55:29,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067317106] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:29,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 04:55:29,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2023-01-28 04:55:29,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778470070] [2023-01-28 04:55:29,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:55:29,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 04:55:29,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:55:29,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 04:55:29,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-01-28 04:55:29,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 341 [2023-01-28 04:55:29,324 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 04:55:29,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:55:29,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 341 [2023-01-28 04:55:29,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:55:29,735 INFO L130 PetriNetUnfolder]: 2056/2828 cut-off events. [2023-01-28 04:55:29,735 INFO L131 PetriNetUnfolder]: For 13548/13666 co-relation queries the response was YES. [2023-01-28 04:55:29,745 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 04:55:29,759 INFO L137 encePairwiseOnDemand]: 331/341 looper letters, 130 selfloop transitions, 71 changer transitions 0/207 dead transitions. [2023-01-28 04:55:29,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 207 transitions, 2433 flow [2023-01-28 04:55:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 04:55:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 04:55:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1233 transitions. [2023-01-28 04:55:29,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40175953079178883 [2023-01-28 04:55:29,763 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1233 transitions. [2023-01-28 04:55:29,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1233 transitions. [2023-01-28 04:55:29,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:55:29,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1233 transitions. [2023-01-28 04:55:29,766 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 04:55:29,770 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 04:55:29,770 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 04:55:29,770 INFO L175 Difference]: Start difference. First operand has 89 places, 149 transitions, 1706 flow. Second operand 9 states and 1233 transitions. [2023-01-28 04:55:29,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 207 transitions, 2433 flow [2023-01-28 04:55:29,801 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 04:55:29,804 INFO L231 Difference]: Finished difference. Result has 96 places, 151 transitions, 1893 flow [2023-01-28 04:55:29,804 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 04:55:29,805 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 64 predicate places. [2023-01-28 04:55:29,805 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 151 transitions, 1893 flow [2023-01-28 04:55:29,805 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 04:55:29,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:55:29,805 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 04:55:29,810 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 04:55:30,010 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 04:55:30,010 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 04:55:30,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:55:30,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1095595526, now seen corresponding path program 7 times [2023-01-28 04:55:30,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:55:30,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206071441] [2023-01-28 04:55:30,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:30,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:55:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:30,121 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 04:55:30,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:55:30,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206071441] [2023-01-28 04:55:30,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206071441] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:30,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562811602] [2023-01-28 04:55:30,122 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 04:55:30,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:55:30,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:55:30,123 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 04:55:30,130 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 04:55:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:30,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-28 04:55:30,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:55:30,283 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 04:55:30,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:55:30,355 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 04:55:30,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562811602] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:30,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 04:55:30,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2023-01-28 04:55:30,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117395461] [2023-01-28 04:55:30,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:55:30,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 04:55:30,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:55:30,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 04:55:30,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-01-28 04:55:30,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 341 [2023-01-28 04:55:30,358 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 04:55:30,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:55:30,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 341 [2023-01-28 04:55:30,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:55:30,710 INFO L130 PetriNetUnfolder]: 2020/2772 cut-off events. [2023-01-28 04:55:30,710 INFO L131 PetriNetUnfolder]: For 16622/16734 co-relation queries the response was YES. [2023-01-28 04:55:30,717 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 04:55:30,725 INFO L137 encePairwiseOnDemand]: 331/341 looper letters, 95 selfloop transitions, 102 changer transitions 0/203 dead transitions. [2023-01-28 04:55:30,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 203 transitions, 2568 flow [2023-01-28 04:55:30,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 04:55:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 04:55:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1228 transitions. [2023-01-28 04:55:30,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4001303356142066 [2023-01-28 04:55:30,727 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1228 transitions. [2023-01-28 04:55:30,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1228 transitions. [2023-01-28 04:55:30,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:55:30,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1228 transitions. [2023-01-28 04:55:30,729 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 04:55:30,731 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 04:55:30,732 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 04:55:30,732 INFO L175 Difference]: Start difference. First operand has 96 places, 151 transitions, 1893 flow. Second operand 9 states and 1228 transitions. [2023-01-28 04:55:30,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 203 transitions, 2568 flow [2023-01-28 04:55:30,764 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 04:55:30,767 INFO L231 Difference]: Finished difference. Result has 103 places, 153 transitions, 2192 flow [2023-01-28 04:55:30,767 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 04:55:30,767 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 71 predicate places. [2023-01-28 04:55:30,767 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 153 transitions, 2192 flow [2023-01-28 04:55:30,768 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 04:55:30,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:55:30,768 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 04:55:30,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-28 04:55:30,972 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 04:55:30,972 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 04:55:30,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:55:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1081782259, now seen corresponding path program 1 times [2023-01-28 04:55:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:55:30,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673385248] [2023-01-28 04:55:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:55:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:31,037 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 04:55:31,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:55:31,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673385248] [2023-01-28 04:55:31,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673385248] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:55:31,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:55:31,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 04:55:31,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677855208] [2023-01-28 04:55:31,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:55:31,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 04:55:31,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:55:31,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 04:55:31,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 04:55:31,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-01-28 04:55:31,040 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 04:55:31,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:55:31,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-01-28 04:55:31,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:55:31,268 INFO L130 PetriNetUnfolder]: 1876/2602 cut-off events. [2023-01-28 04:55:31,268 INFO L131 PetriNetUnfolder]: For 25072/25806 co-relation queries the response was YES. [2023-01-28 04:55:31,275 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 04:55:31,284 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 166 selfloop transitions, 3 changer transitions 0/194 dead transitions. [2023-01-28 04:55:31,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 194 transitions, 3059 flow [2023-01-28 04:55:31,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 04:55:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 04:55:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2023-01-28 04:55:31,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49266862170087977 [2023-01-28 04:55:31,286 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2023-01-28 04:55:31,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2023-01-28 04:55:31,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:55:31,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2023-01-28 04:55:31,287 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 04:55:31,288 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 04:55:31,288 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 04:55:31,288 INFO L175 Difference]: Start difference. First operand has 103 places, 153 transitions, 2192 flow. Second operand 3 states and 504 transitions. [2023-01-28 04:55:31,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 194 transitions, 3059 flow [2023-01-28 04:55:31,317 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 04:55:31,320 INFO L231 Difference]: Finished difference. Result has 100 places, 153 transitions, 2093 flow [2023-01-28 04:55:31,320 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 04:55:31,320 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 68 predicate places. [2023-01-28 04:55:31,320 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 153 transitions, 2093 flow [2023-01-28 04:55:31,320 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 04:55:31,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:55:31,321 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 04:55:31,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 04:55:31,321 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 04:55:31,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:55:31,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2072266448, now seen corresponding path program 1 times [2023-01-28 04:55:31,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:55:31,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302203798] [2023-01-28 04:55:31,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:31,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:55:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:33,607 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 04:55:33,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:55:33,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302203798] [2023-01-28 04:55:33,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302203798] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:55:33,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95321906] [2023-01-28 04:55:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:55:33,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:55:33,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:55:33,609 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 04:55:33,625 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 04:55:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:55:33,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 51 conjunts are in the unsatisfiable core [2023-01-28 04:55:33,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:55:33,925 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 04:55:33,957 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 04:55:34,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:55:34,095 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 04:55:34,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:55:34,238 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 04:55:34,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:55:34,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 04:55:34,526 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 04:55:34,735 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 04:55:34,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:55:35,909 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 04:55:41,240 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 04:55:41,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 04:55:41,266 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 04:55:41,299 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-01-28 04:55:41,299 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 04:55:41,330 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-01-28 04:55:41,330 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 04:55:41,349 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-01-28 04:55:41,349 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 04:55:41,384 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-01-28 04:55:41,385 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 04:55:41,859 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 04:55:41,859 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 04:55:41,952 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 04:55:41,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95321906] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:55:41,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:55:41,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 41 [2023-01-28 04:55:41,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209202846] [2023-01-28 04:55:41,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:55:41,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-01-28 04:55:41,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:55:41,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-01-28 04:55:41,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1464, Unknown=13, NotChecked=158, Total=1806 [2023-01-28 04:55:41,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 341 [2023-01-28 04:55:41,957 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 04:55:41,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:55:41,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 341 [2023-01-28 04:55:41,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:55:51,402 WARN L222 SmtUtils]: Spent 7.02s 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 04:56:03,468 WARN L222 SmtUtils]: Spent 10.70s 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 04:56:10,304 WARN L222 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 105 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 04:56:39,851 WARN L222 SmtUtils]: Spent 29.24s 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 04:56:48,951 WARN L222 SmtUtils]: Spent 8.87s 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 04:56:58,387 WARN L222 SmtUtils]: Spent 8.54s on a formula simplification. DAG size of input: 150 DAG size of output: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 04:57:25,566 WARN L222 SmtUtils]: Spent 26.47s 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 04:58:11,164 WARN L222 SmtUtils]: Spent 24.04s 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 04:58:34,557 WARN L222 SmtUtils]: Spent 14.74s 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 04:59:00,810 WARN L222 SmtUtils]: Spent 26.02s 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 04:59:23,671 WARN L222 SmtUtils]: Spent 14.99s 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 04:59:48,569 WARN L222 SmtUtils]: Spent 19.45s 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 05:00:09,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:00:25,161 WARN L222 SmtUtils]: Spent 15.75s 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 05:00:54,430 WARN L222 SmtUtils]: Spent 26.88s 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 05:01:02,304 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 05:01:24,556 WARN L222 SmtUtils]: Spent 12.07s 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 05:01:32,975 WARN L222 SmtUtils]: Spent 8.02s 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 05:01:46,135 WARN L222 SmtUtils]: Spent 6.94s 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 05:01:48,416 INFO L130 PetriNetUnfolder]: 6133/8833 cut-off events. [2023-01-28 05:01:48,416 INFO L131 PetriNetUnfolder]: For 70049/70049 co-relation queries the response was YES. [2023-01-28 05:01:48,440 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 05:01:48,470 INFO L137 encePairwiseOnDemand]: 323/341 looper letters, 609 selfloop transitions, 505 changer transitions 42/1156 dead transitions. [2023-01-28 05:01:48,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 1156 transitions, 14436 flow [2023-01-28 05:01:48,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-01-28 05:01:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2023-01-28 05:01:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 7570 transitions. [2023-01-28 05:01:48,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2740668332066182 [2023-01-28 05:01:48,479 INFO L72 ComplementDD]: Start complementDD. Operand 81 states and 7570 transitions. [2023-01-28 05:01:48,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 7570 transitions. [2023-01-28 05:01:48,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:01:48,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 81 states and 7570 transitions. [2023-01-28 05:01:48,487 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 05:01:48,506 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 05:01:48,510 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 05:01:48,510 INFO L175 Difference]: Start difference. First operand has 100 places, 153 transitions, 2093 flow. Second operand 81 states and 7570 transitions. [2023-01-28 05:01:48,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 1156 transitions, 14436 flow [2023-01-28 05:01:48,686 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 05:01:48,696 INFO L231 Difference]: Finished difference. Result has 204 places, 646 transitions, 10231 flow [2023-01-28 05:01:48,696 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 05:01:48,697 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 172 predicate places. [2023-01-28 05:01:48,697 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 646 transitions, 10231 flow [2023-01-28 05:01:48,698 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 05:01:48,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:01:48,698 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 05:01:48,705 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 05:01:48,903 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 05:01:48,904 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 05:01:48,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:01:48,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1236109612, now seen corresponding path program 2 times [2023-01-28 05:01:48,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:01:48,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339177278] [2023-01-28 05:01:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:01:48,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:01:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:01:50,696 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 05:01:50,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:01:50,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339177278] [2023-01-28 05:01:50,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339177278] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:01:50,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270890883] [2023-01-28 05:01:50,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 05:01:50,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:01:50,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:01:50,697 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 05:01:50,698 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 05:01:50,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 05:01:50,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:01:50,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 05:01:50,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:01:51,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:01:51,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:01:51,586 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 05:01:51,811 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 05:01:51,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:01:52,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:01:52,994 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 05:01:53,086 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-01-28 05:01:53,086 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 05:01:53,652 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 05:01:53,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270890883] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:01:53,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:01:53,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2023-01-28 05:01:53,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212682770] [2023-01-28 05:01:53,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:01:53,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-28 05:01:53,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:01:53,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-28 05:01:53,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2023-01-28 05:01:53,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 341 [2023-01-28 05:01:53,666 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 05:01:53,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:01:53,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 341 [2023-01-28 05:01:53,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:02:19,165 INFO L130 PetriNetUnfolder]: 12320/17724 cut-off events. [2023-01-28 05:02:19,165 INFO L131 PetriNetUnfolder]: For 180393/180393 co-relation queries the response was YES. [2023-01-28 05:02:19,235 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 05:02:19,299 INFO L137 encePairwiseOnDemand]: 322/341 looper letters, 823 selfloop transitions, 1275 changer transitions 51/2149 dead transitions. [2023-01-28 05:02:19,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 2149 transitions, 31039 flow [2023-01-28 05:02:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-01-28 05:02:19,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2023-01-28 05:02:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 10792 transitions. [2023-01-28 05:02:19,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3102754298200219 [2023-01-28 05:02:19,322 INFO L72 ComplementDD]: Start complementDD. Operand 102 states and 10792 transitions. [2023-01-28 05:02:19,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 10792 transitions. [2023-01-28 05:02:19,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:02:19,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 102 states and 10792 transitions. [2023-01-28 05:02:19,333 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 05:02:19,352 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 05:02:19,356 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 05:02:19,356 INFO L175 Difference]: Start difference. First operand has 204 places, 646 transitions, 10231 flow. Second operand 102 states and 10792 transitions. [2023-01-28 05:02:19,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 2149 transitions, 31039 flow [2023-01-28 05:02:20,224 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 05:02:20,247 INFO L231 Difference]: Finished difference. Result has 356 places, 1489 transitions, 24596 flow [2023-01-28 05:02:20,248 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 05:02:20,248 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 324 predicate places. [2023-01-28 05:02:20,249 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 1489 transitions, 24596 flow [2023-01-28 05:02:20,249 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 05:02:20,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:02:20,250 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 05:02:20,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-28 05:02:20,454 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 05:02:20,455 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 05:02:20,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:02:20,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1304888468, now seen corresponding path program 3 times [2023-01-28 05:02:20,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:02:20,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084466195] [2023-01-28 05:02:20,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:02:20,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:02:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:02:22,209 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 05:02:22,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:02:22,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084466195] [2023-01-28 05:02:22,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084466195] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:02:22,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756956744] [2023-01-28 05:02:22,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 05:02:22,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:02:22,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:02:22,212 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 05:02:22,214 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 05:02:22,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 05:02:22,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:02:22,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 50 conjunts are in the unsatisfiable core [2023-01-28 05:02:22,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:02:22,430 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 05:02:22,477 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 05:02:22,530 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 05:02:22,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:02:22,664 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 05:02:23,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:02:23,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:02:23,121 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 05:02:23,350 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 05:02:23,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:02:27,190 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 05:02:27,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:02:27,232 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 05:02:27,283 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-01-28 05:02:27,284 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 05:02:27,336 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-01-28 05:02:27,336 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 05:02:27,391 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-01-28 05:02:27,391 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 05:02:27,452 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-01-28 05:02:27,452 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 05:02:28,167 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 05:02:28,167 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 05:02:28,269 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 05:02:28,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756956744] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:02:28,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:02:28,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 38 [2023-01-28 05:02:28,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785654482] [2023-01-28 05:02:28,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:02:28,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-01-28 05:02:28,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:02:28,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-01-28 05:02:28,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1309, Unknown=15, NotChecked=74, Total=1560 [2023-01-28 05:02:28,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 341 [2023-01-28 05:02:28,274 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 05:02:28,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:02:28,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 341 [2023-01-28 05:02:28,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:02:50,711 WARN L222 SmtUtils]: Spent 6.12s 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 05:03:09,810 WARN L222 SmtUtils]: Spent 13.20s 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 05:03:18,198 WARN L222 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 78 DAG size of output: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:03:34,115 WARN L222 SmtUtils]: Spent 13.06s 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 05:03:52,029 WARN L222 SmtUtils]: Spent 9.02s 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 05:04:00,113 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (= (mod c_~sorted3~0 256) 0)) (.cse12 (= c_~sorted2~0 (* 256 (div c_~sorted2~0 256))))) (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse26 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse4 (not .cse12)) (.cse13 (< 2 c_~N~0)) (.cse14 (not .cse9)) (.cse7 (+ c_~A~0.offset 4)) (.cse3 (= (mod c_~sorted1~0 256) 0))) (and (let ((.cse1 (select .cse2 4)) (.cse0 (select .cse2 0))) (or (and (< .cse0 .cse1) (= 1 c_~sorted1~0)) (and (= 0 c_~sorted1~0) (<= .cse1 .cse0)))) (= c_~sorted2~0 1) (or .cse3 (let ((.cse8 (select .cse2 c_~A~0.offset))) (and (or .cse4 (forall ((v_ArrVal_688 (Array Int Int)) (v_thread3Thread1of1ForFork2_~i~2_84 Int)) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_84 2) c_~N~0) (let ((.cse6 (* v_thread3Thread1of1ForFork2_~i~2_84 4))) (<= (select .cse5 (+ c_~A~0.offset .cse6 4)) (select .cse5 (+ c_~A~0.offset .cse6)))) (<= c_~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_84 1)) (< 0 v_thread3Thread1of1ForFork2_~i~2_84) (<= (select .cse5 .cse7) .cse8))))) (or .cse9 (forall ((v_ArrVal_688 (Array Int Int)) (v_thread3Thread1of1ForFork2_~i~2_84 Int)) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_84 2) c_~N~0) (let ((.cse11 (* v_thread3Thread1of1ForFork2_~i~2_84 4))) (<= (select .cse10 (+ c_~A~0.offset .cse11 4)) (select .cse10 (+ c_~A~0.offset .cse11)))) (<= c_~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_84 1)) (< .cse8 (select .cse10 .cse7)) (< 0 v_thread3Thread1of1ForFork2_~i~2_84)))) .cse12) (or .cse13 .cse14 (forall ((v_ArrVal_688 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base) .cse7) .cse8))) (forall ((v_ArrVal_688 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_84 Int)) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_84 2) c_~N~0) (<= c_~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_84 1)) (let ((.cse16 (* v_thread3Thread1of1ForFork2_~i~2_84 4))) (< (select .cse15 (+ c_~A~0.offset .cse16)) (select .cse15 (+ c_~A~0.offset .cse16 4)))) (< 0 v_thread3Thread1of1ForFork2_~i~2_84))) (<= (select .cse15 .cse7) .cse8))))))) (or (let ((.cse25 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse19 (select .cse2 (+ c_~A~0.offset .cse25))) (.cse18 (+ c_~A~0.offset 4 .cse25))) (and (or .cse4 (forall ((v_ArrVal_688 (Array Int Int)) (v_thread3Thread1of1ForFork2_~i~2_84 Int)) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (<= (select .cse17 .cse18) .cse19) (< (+ v_thread3Thread1of1ForFork2_~i~2_84 2) c_~N~0) (let ((.cse20 (* v_thread3Thread1of1ForFork2_~i~2_84 4))) (<= (select .cse17 (+ c_~A~0.offset .cse20 4)) (select .cse17 (+ c_~A~0.offset .cse20)))) (<= c_~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_84 1)) (< 0 v_thread3Thread1of1ForFork2_~i~2_84))))) (forall ((v_ArrVal_688 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (<= (select .cse21 .cse18) .cse19) (forall ((v_thread3Thread1of1ForFork2_~i~2_84 Int)) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_84 2) c_~N~0) (<= c_~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_84 1)) (let ((.cse22 (* v_thread3Thread1of1ForFork2_~i~2_84 4))) (< (select .cse21 (+ c_~A~0.offset .cse22)) (select .cse21 (+ c_~A~0.offset .cse22 4)))) (< 0 v_thread3Thread1of1ForFork2_~i~2_84)))))) (or .cse13 (forall ((v_ArrVal_688 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base) .cse18) .cse19)) .cse14) (or .cse9 .cse12 (forall ((v_ArrVal_688 (Array Int Int)) (v_thread3Thread1of1ForFork2_~i~2_84 Int)) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< .cse19 (select .cse23 .cse18)) (< (+ v_thread3Thread1of1ForFork2_~i~2_84 2) c_~N~0) (let ((.cse24 (* v_thread3Thread1of1ForFork2_~i~2_84 4))) (<= (select .cse23 (+ c_~A~0.offset .cse24 4)) (select .cse23 (+ c_~A~0.offset .cse24)))) (<= c_~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_84 1)) (< 0 v_thread3Thread1of1ForFork2_~i~2_84)))))))) .cse3) (<= c_thread2Thread1of1ForFork1_~i~1 0) (<= .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse26 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 2 c_~N~0) (= c_~A~0.offset 0) (= c_~sorted3~0 1) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse26 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (and (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse27 (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_84 Int)) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_84 2) c_~N~0) (<= c_~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_84 1)) (let ((.cse28 (* v_thread3Thread1of1ForFork2_~i~2_84 4))) (< (select .cse27 (+ c_~A~0.offset .cse28)) (select .cse27 (+ c_~A~0.offset .cse28 4)))) (< 0 v_thread3Thread1of1ForFork2_~i~2_84))) (<= (select .cse27 .cse7) (select (select .cse29 c_~A~0.base) c_~A~0.offset)))))) (or .cse4 (forall ((v_ArrVal_688 (Array Int Int)) (v_thread3Thread1of1ForFork2_~i~2_84 Int) (v_ArrVal_687 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse30 (select (store .cse32 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_84 2) c_~N~0) (let ((.cse31 (* v_thread3Thread1of1ForFork2_~i~2_84 4))) (<= (select .cse30 (+ c_~A~0.offset .cse31 4)) (select .cse30 (+ c_~A~0.offset .cse31)))) (<= c_~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_84 1)) (<= (select .cse30 .cse7) (select (select .cse32 c_~A~0.base) c_~A~0.offset)) (< 0 v_thread3Thread1of1ForFork2_~i~2_84)))))) (or .cse13 .cse14 (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (<= (select (select (store .cse33 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base) .cse7) (select (select .cse33 c_~A~0.base) c_~A~0.offset))))) (or .cse9 .cse12 (forall ((v_ArrVal_688 (Array Int Int)) (v_thread3Thread1of1ForFork2_~i~2_84 Int) (v_ArrVal_687 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse34 (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_84 2) c_~N~0) (let ((.cse35 (* v_thread3Thread1of1ForFork2_~i~2_84 4))) (<= (select .cse34 (+ c_~A~0.offset .cse35 4)) (select .cse34 (+ c_~A~0.offset .cse35)))) (<= c_~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_84 1)) (< (select (select .cse36 c_~A~0.base) c_~A~0.offset) (select .cse34 .cse7)) (< 0 v_thread3Thread1of1ForFork2_~i~2_84))))))) .cse3)))) is different from false [2023-01-28 05:04:23,033 WARN L222 SmtUtils]: Spent 16.13s on a formula simplification. DAG size of input: 124 DAG size of output: 119 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:04:51,460 WARN L222 SmtUtils]: Spent 10.47s 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 05:04:53,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:05:21,191 WARN L222 SmtUtils]: Spent 27.01s 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 05:05:34,844 WARN L222 SmtUtils]: Spent 13.42s on a formula simplification. DAG size of input: 104 DAG size of output: 101 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:05:45,219 WARN L222 SmtUtils]: Spent 7.61s on a formula simplification. DAG size of input: 150 DAG size of output: 103 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:06:04,460 WARN L222 SmtUtils]: Spent 8.27s 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 05:06:06,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:06:15,553 WARN L222 SmtUtils]: Spent 8.58s 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 05:06:20,912 WARN L222 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 172 DAG size of output: 118 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:06:43,363 WARN L222 SmtUtils]: Spent 22.11s on a formula simplification. DAG size of input: 155 DAG size of output: 150 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:06:49,858 WARN L222 SmtUtils]: Spent 5.38s 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 05:07:01,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:07:07,517 WARN L222 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 144 DAG size of output: 126 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:07:18,274 WARN L222 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 140 DAG size of output: 93 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:07:34,115 WARN L222 SmtUtils]: Spent 15.10s on a formula simplification that was a NOOP. DAG size: 148 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:08:19,262 WARN L222 SmtUtils]: Spent 28.87s on a formula simplification. DAG size of input: 168 DAG size of output: 163 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:08:30,244 WARN L222 SmtUtils]: Spent 7.51s 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 05:08:42,178 WARN L222 SmtUtils]: Spent 6.58s on a formula simplification. DAG size of input: 146 DAG size of output: 93 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:08:49,546 WARN L222 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 119 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:08:56,897 WARN L222 SmtUtils]: Spent 6.95s on a formula simplification. DAG size of input: 135 DAG size of output: 109 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:09:06,926 WARN L222 SmtUtils]: Spent 8.45s on a formula simplification. DAG size of input: 157 DAG size of output: 139 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:09:12,926 WARN L222 SmtUtils]: Spent 5.68s on a formula simplification. DAG size of input: 157 DAG size of output: 139 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:09:29,681 WARN L222 SmtUtils]: Spent 7.41s 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 05:09:37,656 WARN L222 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 135 DAG size of output: 132 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-01-28 05:09:44,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2023-01-28 05:09:44,225 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 05:09:44,234 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 05:09:44,247 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 05:09:44,251 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 05:09:44,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-28 05:09:44,432 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 155 known predicates. [2023-01-28 05:09:44,434 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-01-28 05:09:44,434 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-01-28 05:09:44,434 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-01-28 05:09:44,434 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1, 1, 1] [2023-01-28 05:09:44,437 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 05:09:44,437 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 05:09:44,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 05:09:44 BasicIcfg [2023-01-28 05:09:44,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 05:09:44,439 INFO L158 Benchmark]: Toolchain (without parser) took 869507.43ms. Allocated memory was 348.1MB in the beginning and 1.3GB in the end (delta: 971.0MB). Free memory was 296.2MB in the beginning and 341.6MB in the end (delta: -45.4MB). Peak memory consumption was 927.6MB. Max. memory is 16.0GB. [2023-01-28 05:09:44,439 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 214.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 05:09:44,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.20ms. Allocated memory is still 348.1MB. Free memory was 296.0MB in the beginning and 284.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-28 05:09:44,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.57ms. Allocated memory is still 348.1MB. Free memory was 284.4MB in the beginning and 282.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 05:09:44,440 INFO L158 Benchmark]: Boogie Preprocessor took 16.88ms. Allocated memory is still 348.1MB. Free memory was 282.6MB in the beginning and 280.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 05:09:44,440 INFO L158 Benchmark]: RCFGBuilder took 473.44ms. Allocated memory is still 348.1MB. Free memory was 280.8MB in the beginning and 310.8MB in the end (delta: -30.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-28 05:09:44,440 INFO L158 Benchmark]: TraceAbstraction took 868797.23ms. Allocated memory was 348.1MB in the beginning and 1.3GB in the end (delta: 971.0MB). Free memory was 310.2MB in the beginning and 341.6MB in the end (delta: -31.4MB). Peak memory consumption was 940.3MB. Max. memory is 16.0GB. [2023-01-28 05:09:44,441 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 214.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 183.20ms. Allocated memory is still 348.1MB. Free memory was 296.0MB in the beginning and 284.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.57ms. Allocated memory is still 348.1MB. Free memory was 284.4MB in the beginning and 282.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 16.88ms. Allocated memory is still 348.1MB. Free memory was 282.6MB in the beginning and 280.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 473.44ms. Allocated memory is still 348.1MB. Free memory was 280.8MB in the beginning and 310.8MB in the end (delta: -30.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * TraceAbstraction took 868797.23ms. Allocated memory was 348.1MB in the beginning and 1.3GB in the end (delta: 971.0MB). Free memory was 310.2MB in the beginning and 341.6MB in the end (delta: -31.4MB). Peak memory consumption was 940.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 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 - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 155 known predicates. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 155 known predicates. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 155 known predicates. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 155 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 215 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 868.7s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 833.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 403 mSolverCounterUnknown, 3638 SdHoareTripleChecker+Valid, 38.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3638 mSDsluCounter, 977 SdHoareTripleChecker+Invalid, 36.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2759 IncrementalHoareTripleChecker+Unchecked, 888 mSDsCounter, 354 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17169 IncrementalHoareTripleChecker+Invalid, 20685 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 354 mSolverCounterUnsat, 89 mSDtfsCounter, 17169 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1049 GetRequests, 440 SyntacticMatches, 17 SemanticMatches, 591 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 18844 ImplicationChecksByTransitivity, 793.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24596occurred in iteration=15, InterpolantAutomatonStates: 281, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 25.6s InterpolantComputationTime, 685 NumberOfCodeBlocks, 685 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 953 ConstructedInterpolants, 27 QuantifiedInterpolants, 16802 SizeOfPredicates, 132 NumberOfNonLiveVariables, 3039 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 42 InterpolantComputations, 8 PerfectInterpolantSequences, 68/153 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown