/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-min-max-inc.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 04:16:25,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 04:16:25,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 04:16:25,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 04:16:25,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 04:16:25,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 04:16:25,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 04:16:25,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 04:16:25,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 04:16:25,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 04:16:25,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 04:16:25,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 04:16:25,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 04:16:25,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 04:16:25,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 04:16:25,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 04:16:25,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 04:16:25,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 04:16:25,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 04:16:25,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 04:16:25,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 04:16:25,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 04:16:25,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 04:16:25,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 04:16:25,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 04:16:25,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 04:16:25,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 04:16:25,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 04:16:25,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 04:16:25,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 04:16:25,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 04:16:25,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 04:16:25,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 04:16:25,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 04:16:25,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 04:16:25,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 04:16:25,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 04:16:25,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 04:16:25,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 04:16:25,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 04:16:25,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 04:16:25,140 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:16:25,169 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 04:16:25,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 04:16:25,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 04:16:25,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 04:16:25,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 04:16:25,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 04:16:25,172 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 04:16:25,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 04:16:25,172 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 04:16:25,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 04:16:25,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 04:16:25,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 04:16:25,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 04:16:25,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 04:16:25,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 04:16:25,173 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 04:16:25,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 04:16:25,174 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 04:16:25,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 04:16:25,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 04:16:25,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 04:16:25,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 04:16:25,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 04:16:25,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 04:16:25,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 04:16:25,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 04:16:25,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 04:16:25,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 04:16:25,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 04:16:25,175 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 04:16:25,175 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 04:16:25,175 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:16:25,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 04:16:25,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 04:16:25,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 04:16:25,428 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 04:16:25,429 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 04:16:25,430 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2023-01-28 04:16:26,416 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 04:16:26,662 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 04:16:26,663 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2023-01-28 04:16:26,668 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d41088f8/177cb8b4aaca46d787ef0287abcee557/FLAG370ff1a40 [2023-01-28 04:16:27,043 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d41088f8/177cb8b4aaca46d787ef0287abcee557 [2023-01-28 04:16:27,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 04:16:27,045 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 04:16:27,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 04:16:27,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 04:16:27,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 04:16:27,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 04:16:27" (1/1) ... [2023-01-28 04:16:27,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f4acd24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:16:27, skipping insertion in model container [2023-01-28 04:16:27,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 04:16:27" (1/1) ... [2023-01-28 04:16:27,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 04:16:27,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 04:16:27,269 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-min-max-inc.wvr.c[3018,3031] [2023-01-28 04:16:27,285 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 04:16:27,297 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 04:16:27,329 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-min-max-inc.wvr.c[3018,3031] [2023-01-28 04:16:27,332 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 04:16:27,340 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 04:16:27,340 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 04:16:27,346 INFO L208 MainTranslator]: Completed translation [2023-01-28 04:16:27,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:16:27 WrapperNode [2023-01-28 04:16:27,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 04:16:27,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 04:16:27,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 04:16:27,348 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 04:16:27,353 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:16:27" (1/1) ... [2023-01-28 04:16:27,366 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:16:27" (1/1) ... [2023-01-28 04:16:27,384 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2023-01-28 04:16:27,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 04:16:27,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 04:16:27,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 04:16:27,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 04:16:27,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:16:27" (1/1) ... [2023-01-28 04:16:27,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:16:27" (1/1) ... [2023-01-28 04:16:27,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:16:27" (1/1) ... [2023-01-28 04:16:27,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:16:27" (1/1) ... [2023-01-28 04:16:27,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:16:27" (1/1) ... [2023-01-28 04:16:27,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:16:27" (1/1) ... [2023-01-28 04:16:27,410 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:16:27" (1/1) ... [2023-01-28 04:16:27,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:16:27" (1/1) ... [2023-01-28 04:16:27,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 04:16:27,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 04:16:27,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 04:16:27,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 04:16:27,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:16:27" (1/1) ... [2023-01-28 04:16:27,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 04:16:27,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:16:27,454 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:16:27,481 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:16:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 04:16:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 04:16:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 04:16:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 04:16:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 04:16:27,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 04:16:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 04:16:27,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 04:16:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 04:16:27,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 04:16:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-01-28 04:16:27,497 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-01-28 04:16:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 04:16:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 04:16:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 04:16:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 04:16:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 04:16:27,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 04:16:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 04:16:27,499 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:16:27,655 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 04:16:27,656 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 04:16:27,896 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 04:16:27,972 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 04:16:27,972 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-28 04:16:27,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 04:16:27 BoogieIcfgContainer [2023-01-28 04:16:27,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 04:16:27,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 04:16:27,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 04:16:27,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 04:16:27,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 04:16:27" (1/3) ... [2023-01-28 04:16:27,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67256a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 04:16:27, skipping insertion in model container [2023-01-28 04:16:27,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 04:16:27" (2/3) ... [2023-01-28 04:16:27,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67256a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 04:16:27, skipping insertion in model container [2023-01-28 04:16:27,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 04:16:27" (3/3) ... [2023-01-28 04:16:27,994 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2023-01-28 04:16:28,008 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 04:16:28,008 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 04:16:28,009 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 04:16:28,137 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-01-28 04:16:28,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 162 transitions, 356 flow [2023-01-28 04:16:28,230 INFO L130 PetriNetUnfolder]: 12/158 cut-off events. [2023-01-28 04:16:28,230 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 04:16:28,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 158 events. 12/158 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 115 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2023-01-28 04:16:28,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 162 transitions, 356 flow [2023-01-28 04:16:28,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 146 transitions, 316 flow [2023-01-28 04:16:28,243 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 04:16:28,251 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 146 transitions, 316 flow [2023-01-28 04:16:28,253 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 146 transitions, 316 flow [2023-01-28 04:16:28,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 146 transitions, 316 flow [2023-01-28 04:16:28,315 INFO L130 PetriNetUnfolder]: 12/146 cut-off events. [2023-01-28 04:16:28,315 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 04:16:28,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 146 events. 12/146 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2023-01-28 04:16:28,322 INFO L119 LiptonReduction]: Number of co-enabled transitions 2280 [2023-01-28 04:16:33,155 INFO L134 LiptonReduction]: Checked pairs total: 3482 [2023-01-28 04:16:33,155 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-01-28 04:16:33,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 04:16:33,172 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;@45bfd6d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 04:16:33,172 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 04:16:33,179 INFO L130 PetriNetUnfolder]: 4/30 cut-off events. [2023-01-28 04:16:33,179 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 04:16:33,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:16:33,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:16:33,180 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 2 more)] === [2023-01-28 04:16:33,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:16:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash -957242749, now seen corresponding path program 1 times [2023-01-28 04:16:33,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:16:33,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012249493] [2023-01-28 04:16:33,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:16:33,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:16:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:16:33,612 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:16:33,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:16:33,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012249493] [2023-01-28 04:16:33,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012249493] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:16:33,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:16:33,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 04:16:33,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575060980] [2023-01-28 04:16:33,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:16:33,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 04:16:33,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:16:33,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 04:16:33,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 04:16:33,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 296 [2023-01-28 04:16:33,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have 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:16:33,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:16:33,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 296 [2023-01-28 04:16:33,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:16:33,928 INFO L130 PetriNetUnfolder]: 1420/1898 cut-off events. [2023-01-28 04:16:33,928 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2023-01-28 04:16:33,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3999 conditions, 1898 events. 1420/1898 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7098 event pairs, 765 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 3498. Up to 1552 conditions per place. [2023-01-28 04:16:33,945 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-01-28 04:16:33,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2023-01-28 04:16:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 04:16:33,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 04:16:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-01-28 04:16:33,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46790540540540543 [2023-01-28 04:16:33,964 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-01-28 04:16:33,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-01-28 04:16:33,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:16:33,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-01-28 04:16:33,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have 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:16:33,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have 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:16:33,982 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have 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:16:33,983 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 554 transitions. [2023-01-28 04:16:33,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 215 flow [2023-01-28 04:16:33,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-01-28 04:16:33,992 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2023-01-28 04:16:33,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-01-28 04:16:33,997 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-01-28 04:16:33,998 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2023-01-28 04:16:33,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have 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:16:33,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:16:33,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:16:33,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 04:16:33,999 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 2 more)] === [2023-01-28 04:16:34,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:16:34,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1622835390, now seen corresponding path program 1 times [2023-01-28 04:16:34,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:16:34,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315599073] [2023-01-28 04:16:34,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:16:34,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:16:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:16:34,184 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:16:34,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:16:34,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315599073] [2023-01-28 04:16:34,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315599073] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:16:34,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:16:34,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 04:16:34,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096608173] [2023-01-28 04:16:34,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:16:34,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 04:16:34,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:16:34,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 04:16:34,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 04:16:34,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 296 [2023-01-28 04:16:34,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have 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:16:34,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:16:34,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 296 [2023-01-28 04:16:34,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:16:34,441 INFO L130 PetriNetUnfolder]: 1718/2336 cut-off events. [2023-01-28 04:16:34,441 INFO L131 PetriNetUnfolder]: For 549/549 co-relation queries the response was YES. [2023-01-28 04:16:34,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2336 events. 1718/2336 cut-off events. For 549/549 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8125 event pairs, 977 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 2424. Up to 1790 conditions per place. [2023-01-28 04:16:34,455 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-01-28 04:16:34,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 233 flow [2023-01-28 04:16:34,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 04:16:34,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 04:16:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2023-01-28 04:16:34,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4704391891891892 [2023-01-28 04:16:34,459 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2023-01-28 04:16:34,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2023-01-28 04:16:34,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:16:34,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2023-01-28 04:16:34,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have 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:16:34,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have 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:16:34,464 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have 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:16:34,464 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 557 transitions. [2023-01-28 04:16:34,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 233 flow [2023-01-28 04:16:34,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 04:16:34,467 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2023-01-28 04:16:34,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-01-28 04:16:34,470 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-01-28 04:16:34,470 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2023-01-28 04:16:34,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have 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:16:34,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:16:34,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:16:34,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 04:16:34,471 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 2 more)] === [2023-01-28 04:16:34,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:16:34,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1337805984, now seen corresponding path program 1 times [2023-01-28 04:16:34,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:16:34,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123964043] [2023-01-28 04:16:34,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:16:34,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:16:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:16:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:16:34,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:16:34,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123964043] [2023-01-28 04:16:34,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123964043] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:16:34,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:16:34,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 04:16:34,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991580090] [2023-01-28 04:16:34,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:16:34,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 04:16:34,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:16:34,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 04:16:34,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 04:16:34,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 296 [2023-01-28 04:16:34,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have 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:16:34,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:16:34,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 296 [2023-01-28 04:16:34,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:16:34,829 INFO L130 PetriNetUnfolder]: 1632/2232 cut-off events. [2023-01-28 04:16:34,830 INFO L131 PetriNetUnfolder]: For 545/694 co-relation queries the response was YES. [2023-01-28 04:16:34,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 2232 events. 1632/2232 cut-off events. For 545/694 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8389 event pairs, 977 based on Foata normal form. 149/1982 useless extension candidates. Maximal degree in co-relation 1672. Up to 1790 conditions per place. [2023-01-28 04:16:34,841 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 46 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-01-28 04:16:34,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 240 flow [2023-01-28 04:16:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 04:16:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 04:16:34,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-01-28 04:16:34,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46790540540540543 [2023-01-28 04:16:34,843 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-01-28 04:16:34,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-01-28 04:16:34,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:16:34,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-01-28 04:16:34,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have 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:16:34,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have 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:16:34,847 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have 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:16:34,847 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 554 transitions. [2023-01-28 04:16:34,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 240 flow [2023-01-28 04:16:34,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 231 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 04:16:34,851 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 100 flow [2023-01-28 04:16:34,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-01-28 04:16:34,852 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-01-28 04:16:34,854 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 100 flow [2023-01-28 04:16:34,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have 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:16:34,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:16:34,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:16:34,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 04:16:34,855 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 2 more)] === [2023-01-28 04:16:34,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:16:34,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1347991008, now seen corresponding path program 1 times [2023-01-28 04:16:34,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:16:34,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5355809] [2023-01-28 04:16:34,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:16:34,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:16:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:16:35,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 04:16:35,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:16:35,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5355809] [2023-01-28 04:16:35,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5355809] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:16:35,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:16:35,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 04:16:35,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305628736] [2023-01-28 04:16:35,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:16:35,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 04:16:35,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:16:35,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 04:16:35,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 04:16:35,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 296 [2023-01-28 04:16:35,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have 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:16:35,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:16:35,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 296 [2023-01-28 04:16:35,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:16:35,196 INFO L130 PetriNetUnfolder]: 1632/2233 cut-off events. [2023-01-28 04:16:35,196 INFO L131 PetriNetUnfolder]: For 878/1027 co-relation queries the response was YES. [2023-01-28 04:16:35,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5793 conditions, 2233 events. 1632/2233 cut-off events. For 878/1027 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8188 event pairs, 1243 based on Foata normal form. 149/1978 useless extension candidates. Maximal degree in co-relation 1883. Up to 2223 conditions per place. [2023-01-28 04:16:35,209 INFO L137 encePairwiseOnDemand]: 293/296 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-01-28 04:16:35,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 170 flow [2023-01-28 04:16:35,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 04:16:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 04:16:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-01-28 04:16:35,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380630630630631 [2023-01-28 04:16:35,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-01-28 04:16:35,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-01-28 04:16:35,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:16:35,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-01-28 04:16:35,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have 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:16:35,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have 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:16:35,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have 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:16:35,215 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 100 flow. Second operand 3 states and 389 transitions. [2023-01-28 04:16:35,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 170 flow [2023-01-28 04:16:35,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 04:16:35,217 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 106 flow [2023-01-28 04:16:35,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-01-28 04:16:35,218 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-01-28 04:16:35,218 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 106 flow [2023-01-28 04:16:35,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have 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:16:35,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:16:35,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:16:35,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 04:16:35,219 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 2 more)] === [2023-01-28 04:16:35,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:16:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash -406219004, now seen corresponding path program 1 times [2023-01-28 04:16:35,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:16:35,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864736885] [2023-01-28 04:16:35,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:16:35,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:16:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:16:35,986 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:16:35,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:16:35,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864736885] [2023-01-28 04:16:35,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864736885] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:16:35,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415019348] [2023-01-28 04:16:35,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:16:35,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:16:35,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:16:35,990 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:16:35,993 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:16:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:16:36,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 49 conjunts are in the unsatisfiable core [2023-01-28 04:16:36,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:16:36,280 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:16:36,338 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:16:36,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:16:36,414 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:16:36,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:16:36,503 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:16:36,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2023-01-28 04:16:36,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:16:36,708 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 16 treesize of output 18 [2023-01-28 04:16:36,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-01-28 04:16:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 04:16:36,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:16:37,021 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset (* 4 c_thread2Thread1of1ForFork3_~i~1)))) (and (or (<= 2147483647 c_~max~0) (<= c_~min~0 (+ c_~max~0 1)) (forall ((v_ArrVal_188 (Array Int Int))) (<= c_~max~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) .cse0)))) (forall ((v_ArrVal_188 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) .cse0))) (or (< .cse1 c_~max~0) (<= 2147483647 .cse1) (<= c_~min~0 (+ .cse1 1))))))) is different from false [2023-01-28 04:16:39,469 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse2 c_~A~0.offset))) (or (<= 2147483647 .cse0) (forall ((v_ArrVal_186 Int) (v_ArrVal_188 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse2 c_~A~0.offset v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) c_~A~0.offset))) (or (< v_ArrVal_186 (+ .cse0 1)) (<= 2147483647 .cse1) (<= c_~min~0 (+ .cse1 1)))))))) is different from false [2023-01-28 04:16:39,489 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_186 Int) (v_ArrVal_185 (Array Int Int)) (v_ArrVal_188 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185))) (let ((.cse3 (select .cse2 c_~A~0.base))) (let ((.cse0 (select .cse3 c_~A~0.offset)) (.cse1 (select (select (store (store .cse2 c_~A~0.base (store .cse3 c_~A~0.offset v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) c_~A~0.offset))) (or (< v_ArrVal_186 (+ .cse0 1)) (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse1 1)) (<= 2147483647 .cse1)))))) is different from false [2023-01-28 04:16:39,946 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~min~0) (forall ((v_ArrVal_186 Int) (v_ArrVal_185 (Array Int Int)) (v_ArrVal_188 (Array Int Int))) (let ((.cse4 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185))) (let ((.cse3 (select .cse4 c_~A~0.base))) (let ((.cse2 (select (select (store (store .cse4 c_~A~0.base (store .cse3 c_~A~0.offset v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) c_~A~0.offset)) (.cse1 (select .cse3 c_~A~0.offset))) (or (< v_ArrVal_186 (+ .cse1 1)) (<= 2147483647 .cse2) (<= c_~min~0 (+ .cse2 1)) (<= 2147483647 .cse1))))))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse5 (select (select .cse10 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse5) (forall ((v_ArrVal_186 Int) (v_ArrVal_185 (Array Int Int)) (v_ArrVal_188 (Array Int Int))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185))) (let ((.cse8 (select .cse9 c_~A~0.base))) (let ((.cse7 (select (select (store (store .cse9 c_~A~0.base (store .cse8 c_~A~0.offset v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) c_~A~0.offset)) (.cse6 (select .cse8 c_~A~0.offset))) (or (< v_ArrVal_186 (+ .cse6 1)) (<= 2147483647 .cse7) (<= .cse5 (+ .cse7 1)) (<= 2147483647 .cse6))))))))))) is different from false [2023-01-28 04:16:40,025 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse2 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_186 Int) (v_ArrVal_185 (Array Int Int)) (v_ArrVal_188 (Array Int Int))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185))) (let ((.cse3 (select .cse4 c_~A~0.base))) (let ((.cse1 (select (select (store (store .cse4 c_~A~0.base (store .cse3 c_~A~0.offset v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) c_~A~0.offset)) (.cse0 (select .cse3 c_~A~0.offset))) (or (< v_ArrVal_186 (+ .cse0 1)) (<= 2147483647 .cse1) (<= .cse2 (+ .cse1 1)) (<= 2147483647 .cse0)))))) (< .cse6 .cse2))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (<= (select (select .cse7 c_~A~0.base) c_~A~0.offset) .cse6) (forall ((v_ArrVal_186 Int) (v_ArrVal_185 (Array Int Int)) (v_ArrVal_188 (Array Int Int))) (let ((.cse11 (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185))) (let ((.cse10 (select .cse11 c_~A~0.base))) (let ((.cse9 (select (select (store (store .cse11 c_~A~0.base (store .cse10 c_~A~0.offset v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) c_~A~0.offset)) (.cse8 (select .cse10 c_~A~0.offset))) (or (< v_ArrVal_186 (+ .cse8 1)) (<= .cse6 (+ .cse9 1)) (<= 2147483647 .cse9) (<= 2147483647 .cse8))))))))))) is different from false [2023-01-28 04:16:40,184 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse0 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse1) (forall ((v_ArrVal_186 Int) (v_ArrVal_185 (Array Int Int)) (v_ArrVal_188 (Array Int Int))) (let ((.cse4 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< v_ArrVal_186 (+ .cse2 1)) (<= 2147483647 .cse3) (<= 2147483647 .cse2) (<= .cse1 (+ .cse3 1))))))))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_186 Int) (v_ArrVal_185 (Array Int Int)) (v_ArrVal_188 (Array Int Int))) (let ((.cse10 (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (select (select (store (store .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< v_ArrVal_186 (+ .cse7 1)) (<= 2147483647 .cse8) (<= 2147483647 .cse7) (<= .cse9 (+ .cse8 1))))))) (< (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse9))))))) is different from false [2023-01-28 04:16:40,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 04:16:40,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 247 treesize of output 151 [2023-01-28 04:16:40,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6735 treesize of output 6431 [2023-01-28 04:16:40,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 411 treesize of output 383 [2023-01-28 04:16:40,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 467 treesize of output 435 [2023-01-28 04:16:40,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 356 treesize of output 342 [2023-01-28 04:16:40,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 101 [2023-01-28 04:16:41,673 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 04:16:41,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 1 [2023-01-28 04:16:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-28 04:16:41,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415019348] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:16:41,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:16:41,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 15] total 38 [2023-01-28 04:16:41,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097806934] [2023-01-28 04:16:41,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:16:41,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-01-28 04:16:41,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:16:41,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-01-28 04:16:41,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=950, Unknown=24, NotChecked=414, Total=1560 [2023-01-28 04:16:41,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 296 [2023-01-28 04:16:41,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 106 flow. Second operand has 40 states, 40 states have (on average 84.325) internal successors, (3373), 40 states have internal predecessors, (3373), 0 states have call successors, (0), 0 states have 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:16:41,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:16:41,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 296 [2023-01-28 04:16:41,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:16:48,816 INFO L130 PetriNetUnfolder]: 11757/16175 cut-off events. [2023-01-28 04:16:48,816 INFO L131 PetriNetUnfolder]: For 4289/4289 co-relation queries the response was YES. [2023-01-28 04:16:48,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41406 conditions, 16175 events. 11757/16175 cut-off events. For 4289/4289 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 83673 event pairs, 163 based on Foata normal form. 7/13051 useless extension candidates. Maximal degree in co-relation 41392. Up to 3345 conditions per place. [2023-01-28 04:16:48,867 INFO L137 encePairwiseOnDemand]: 275/296 looper letters, 250 selfloop transitions, 95 changer transitions 332/677 dead transitions. [2023-01-28 04:16:48,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 677 transitions, 3370 flow [2023-01-28 04:16:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-01-28 04:16:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-01-28 04:16:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 4642 transitions. [2023-01-28 04:16:48,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3200496414782129 [2023-01-28 04:16:48,881 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 4642 transitions. [2023-01-28 04:16:48,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 4642 transitions. [2023-01-28 04:16:48,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:16:48,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 4642 transitions. [2023-01-28 04:16:48,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 94.73469387755102) internal successors, (4642), 49 states have internal predecessors, (4642), 0 states have call successors, (0), 0 states have 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:16:48,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 296.0) internal successors, (14800), 50 states have internal predecessors, (14800), 0 states have call successors, (0), 0 states have 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:16:48,915 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 296.0) internal successors, (14800), 50 states have internal predecessors, (14800), 0 states have call successors, (0), 0 states have 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:16:48,915 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 106 flow. Second operand 49 states and 4642 transitions. [2023-01-28 04:16:48,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 677 transitions, 3370 flow [2023-01-28 04:16:48,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 677 transitions, 3366 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 04:16:48,976 INFO L231 Difference]: Finished difference. Result has 123 places, 151 transitions, 1000 flow [2023-01-28 04:16:48,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=1000, PETRI_PLACES=123, PETRI_TRANSITIONS=151} [2023-01-28 04:16:48,977 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 83 predicate places. [2023-01-28 04:16:48,977 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 151 transitions, 1000 flow [2023-01-28 04:16:48,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 84.325) internal successors, (3373), 40 states have internal predecessors, (3373), 0 states have call successors, (0), 0 states have 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:16:48,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:16:48,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:16:48,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-28 04:16:49,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:16:49,194 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 2 more)] === [2023-01-28 04:16:49,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:16:49,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1897529506, now seen corresponding path program 2 times [2023-01-28 04:16:49,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:16:49,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273712827] [2023-01-28 04:16:49,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:16:49,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:16:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:16:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 04:16:49,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:16:49,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273712827] [2023-01-28 04:16:49,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273712827] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:16:49,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:16:49,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 04:16:49,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771520468] [2023-01-28 04:16:49,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:16:49,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 04:16:49,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:16:49,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 04:16:49,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 04:16:49,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2023-01-28 04:16:49,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 151 transitions, 1000 flow. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:16:49,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:16:49,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2023-01-28 04:16:49,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:16:51,109 INFO L130 PetriNetUnfolder]: 9388/13130 cut-off events. [2023-01-28 04:16:51,110 INFO L131 PetriNetUnfolder]: For 138088/138995 co-relation queries the response was YES. [2023-01-28 04:16:51,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70482 conditions, 13130 events. 9388/13130 cut-off events. For 138088/138995 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 68071 event pairs, 1546 based on Foata normal form. 320/12486 useless extension candidates. Maximal degree in co-relation 70427. Up to 7730 conditions per place. [2023-01-28 04:16:51,181 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 122 selfloop transitions, 5 changer transitions 223/353 dead transitions. [2023-01-28 04:16:51,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 353 transitions, 3090 flow [2023-01-28 04:16:51,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:16:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:16:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 747 transitions. [2023-01-28 04:16:51,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047297297297297 [2023-01-28 04:16:51,184 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 747 transitions. [2023-01-28 04:16:51,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 747 transitions. [2023-01-28 04:16:51,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:16:51,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 747 transitions. [2023-01-28 04:16:51,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have 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:16:51,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have 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:16:51,188 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have 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:16:51,188 INFO L175 Difference]: Start difference. First operand has 123 places, 151 transitions, 1000 flow. Second operand 5 states and 747 transitions. [2023-01-28 04:16:51,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 353 transitions, 3090 flow [2023-01-28 04:16:51,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 353 transitions, 2941 flow, removed 73 selfloop flow, removed 16 redundant places. [2023-01-28 04:16:51,758 INFO L231 Difference]: Finished difference. Result has 90 places, 106 transitions, 666 flow [2023-01-28 04:16:51,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=666, PETRI_PLACES=90, PETRI_TRANSITIONS=106} [2023-01-28 04:16:51,758 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 50 predicate places. [2023-01-28 04:16:51,759 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 106 transitions, 666 flow [2023-01-28 04:16:51,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:16:51,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:16:51,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:16:51,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 04:16:51,759 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 2 more)] === [2023-01-28 04:16:51,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:16:51,760 INFO L85 PathProgramCache]: Analyzing trace with hash -360427098, now seen corresponding path program 3 times [2023-01-28 04:16:51,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:16:51,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028712144] [2023-01-28 04:16:51,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:16:51,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:16:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:16:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:16:52,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:16:52,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028712144] [2023-01-28 04:16:52,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028712144] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:16:52,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066143616] [2023-01-28 04:16:52,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 04:16:52,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:16:52,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:16:52,053 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:16:52,085 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:16:52,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-28 04:16:52,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:16:52,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 22 conjunts are in the unsatisfiable core [2023-01-28 04:16:52,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:16:52,269 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:16:52,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-01-28 04:16:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:16:52,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:16:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:16:52,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066143616] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 04:16:52,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 04:16:52,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 7] total 15 [2023-01-28 04:16:52,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121177086] [2023-01-28 04:16:52,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:16:52,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 04:16:52,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:16:52,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 04:16:52,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-01-28 04:16:52,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 296 [2023-01-28 04:16:52,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 106 transitions, 666 flow. Second operand has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have 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:16:52,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:16:52,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 296 [2023-01-28 04:16:52,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:16:54,671 INFO L130 PetriNetUnfolder]: 12721/17732 cut-off events. [2023-01-28 04:16:54,672 INFO L131 PetriNetUnfolder]: For 161766/162252 co-relation queries the response was YES. [2023-01-28 04:16:54,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87124 conditions, 17732 events. 12721/17732 cut-off events. For 161766/162252 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 95947 event pairs, 2235 based on Foata normal form. 178/16498 useless extension candidates. Maximal degree in co-relation 87081. Up to 8222 conditions per place. [2023-01-28 04:16:54,786 INFO L137 encePairwiseOnDemand]: 288/296 looper letters, 153 selfloop transitions, 14 changer transitions 218/388 dead transitions. [2023-01-28 04:16:54,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 388 transitions, 3183 flow [2023-01-28 04:16:54,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 04:16:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 04:16:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 940 transitions. [2023-01-28 04:16:54,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45366795366795365 [2023-01-28 04:16:54,790 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 940 transitions. [2023-01-28 04:16:54,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 940 transitions. [2023-01-28 04:16:54,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:16:54,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 940 transitions. [2023-01-28 04:16:54,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.28571428571428) internal successors, (940), 7 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have 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:16:54,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have 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:16:54,796 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have 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:16:54,796 INFO L175 Difference]: Start difference. First operand has 90 places, 106 transitions, 666 flow. Second operand 7 states and 940 transitions. [2023-01-28 04:16:54,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 388 transitions, 3183 flow [2023-01-28 04:16:56,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 388 transitions, 3026 flow, removed 65 selfloop flow, removed 15 redundant places. [2023-01-28 04:16:56,319 INFO L231 Difference]: Finished difference. Result has 74 places, 115 transitions, 831 flow [2023-01-28 04:16:56,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=831, PETRI_PLACES=74, PETRI_TRANSITIONS=115} [2023-01-28 04:16:56,320 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2023-01-28 04:16:56,320 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 115 transitions, 831 flow [2023-01-28 04:16:56,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have 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:16:56,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:16:56,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:16:56,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 04:16:56,527 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,SelfDestructingSolverStorable6 [2023-01-28 04:16:56,528 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 2 more)] === [2023-01-28 04:16:56,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:16:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1165792048, now seen corresponding path program 4 times [2023-01-28 04:16:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:16:56,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662673310] [2023-01-28 04:16:56,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:16:56,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:16:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:16:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 04:16:56,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:16:56,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662673310] [2023-01-28 04:16:56,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662673310] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 04:16:56,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 04:16:56,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 04:16:56,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117615227] [2023-01-28 04:16:56,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 04:16:56,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 04:16:56,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:16:56,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 04:16:56,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 04:16:56,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2023-01-28 04:16:56,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 115 transitions, 831 flow. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:16:56,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:16:56,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2023-01-28 04:16:56,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:16:57,838 INFO L130 PetriNetUnfolder]: 8772/12553 cut-off events. [2023-01-28 04:16:57,839 INFO L131 PetriNetUnfolder]: For 41809/42186 co-relation queries the response was YES. [2023-01-28 04:16:57,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56071 conditions, 12553 events. 8772/12553 cut-off events. For 41809/42186 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 67642 event pairs, 1679 based on Foata normal form. 144/11649 useless extension candidates. Maximal degree in co-relation 56036. Up to 8102 conditions per place. [2023-01-28 04:16:57,888 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 126 selfloop transitions, 6 changer transitions 101/236 dead transitions. [2023-01-28 04:16:57,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 236 transitions, 2228 flow [2023-01-28 04:16:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 04:16:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 04:16:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 740 transitions. [2023-01-28 04:16:57,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-28 04:16:57,890 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 740 transitions. [2023-01-28 04:16:57,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 740 transitions. [2023-01-28 04:16:57,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:16:57,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 740 transitions. [2023-01-28 04:16:57,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have 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:16:57,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have 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:16:57,895 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have 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:16:57,895 INFO L175 Difference]: Start difference. First operand has 74 places, 115 transitions, 831 flow. Second operand 5 states and 740 transitions. [2023-01-28 04:16:57,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 236 transitions, 2228 flow [2023-01-28 04:16:58,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 236 transitions, 2115 flow, removed 43 selfloop flow, removed 3 redundant places. [2023-01-28 04:16:58,260 INFO L231 Difference]: Finished difference. Result has 75 places, 109 transitions, 748 flow [2023-01-28 04:16:58,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=748, PETRI_PLACES=75, PETRI_TRANSITIONS=109} [2023-01-28 04:16:58,261 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2023-01-28 04:16:58,261 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 109 transitions, 748 flow [2023-01-28 04:16:58,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 04:16:58,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:16:58,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:16:58,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 04:16:58,262 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 2 more)] === [2023-01-28 04:16:58,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:16:58,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1508571068, now seen corresponding path program 5 times [2023-01-28 04:16:58,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:16:58,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876016313] [2023-01-28 04:16:58,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:16:58,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:16:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:16:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:16:58,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:16:58,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876016313] [2023-01-28 04:16:58,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876016313] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:16:58,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320914336] [2023-01-28 04:16:58,999 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 04:16:58,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:16:58,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:16:59,001 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:16:59,009 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:16:59,123 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-28 04:16:59,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:16:59,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 27 conjunts are in the unsatisfiable core [2023-01-28 04:16:59,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:16:59,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-01-28 04:16:59,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:16:59,262 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 16 treesize of output 18 [2023-01-28 04:16:59,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-01-28 04:16:59,405 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:16:59,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:16:59,767 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_thread2Thread1of1ForFork3_~i~1)))) (and (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_385 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_385) c_~A~0.base))) (or (<= (select .cse0 c_~A~0.offset) (+ c_~max~0 1)) (<= c_~max~0 (select .cse0 .cse1)))))) (forall ((v_ArrVal_385 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_385) c_~A~0.base))) (let ((.cse3 (select .cse2 .cse1))) (or (<= (select .cse2 c_~A~0.offset) (+ .cse3 1)) (<= 2147483647 .cse3) (< .cse3 c_~max~0))))))) is different from false [2023-01-28 04:16:59,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:16:59,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320914336] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:16:59,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:16:59,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 8] total 28 [2023-01-28 04:16:59,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63576493] [2023-01-28 04:16:59,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:16:59,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-01-28 04:16:59,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:16:59,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-01-28 04:16:59,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=634, Unknown=1, NotChecked=52, Total=812 [2023-01-28 04:16:59,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 296 [2023-01-28 04:16:59,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 109 transitions, 748 flow. Second operand has 29 states, 29 states have (on average 103.20689655172414) internal successors, (2993), 29 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have 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:16:59,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:16:59,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 296 [2023-01-28 04:16:59,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:17:07,454 INFO L130 PetriNetUnfolder]: 33911/47178 cut-off events. [2023-01-28 04:17:07,454 INFO L131 PetriNetUnfolder]: For 209440/209440 co-relation queries the response was YES. [2023-01-28 04:17:07,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221935 conditions, 47178 events. 33911/47178 cut-off events. For 209440/209440 co-relation queries the response was YES. Maximal size of possible extension queue 1543. Compared 286074 event pairs, 2419 based on Foata normal form. 28/43521 useless extension candidates. Maximal degree in co-relation 221899. Up to 21940 conditions per place. [2023-01-28 04:17:07,677 INFO L137 encePairwiseOnDemand]: 276/296 looper letters, 417 selfloop transitions, 227 changer transitions 1161/1805 dead transitions. [2023-01-28 04:17:07,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 1805 transitions, 15809 flow [2023-01-28 04:17:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-01-28 04:17:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2023-01-28 04:17:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 9288 transitions. [2023-01-28 04:17:07,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38266315095583386 [2023-01-28 04:17:07,695 INFO L72 ComplementDD]: Start complementDD. Operand 82 states and 9288 transitions. [2023-01-28 04:17:07,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 9288 transitions. [2023-01-28 04:17:07,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:17:07,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 82 states and 9288 transitions. [2023-01-28 04:17:07,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 83 states, 82 states have (on average 113.26829268292683) internal successors, (9288), 82 states have internal predecessors, (9288), 0 states have call successors, (0), 0 states have 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:17:07,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 83 states, 83 states have (on average 296.0) internal successors, (24568), 83 states have internal predecessors, (24568), 0 states have call successors, (0), 0 states have 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:17:07,754 INFO L81 ComplementDD]: Finished complementDD. Result has 83 states, 83 states have (on average 296.0) internal successors, (24568), 83 states have internal predecessors, (24568), 0 states have call successors, (0), 0 states have 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:17:07,754 INFO L175 Difference]: Start difference. First operand has 75 places, 109 transitions, 748 flow. Second operand 82 states and 9288 transitions. [2023-01-28 04:17:07,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 1805 transitions, 15809 flow [2023-01-28 04:17:09,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 1805 transitions, 15322 flow, removed 174 selfloop flow, removed 5 redundant places. [2023-01-28 04:17:09,474 INFO L231 Difference]: Finished difference. Result has 216 places, 326 transitions, 3570 flow [2023-01-28 04:17:09,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=3570, PETRI_PLACES=216, PETRI_TRANSITIONS=326} [2023-01-28 04:17:09,475 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 176 predicate places. [2023-01-28 04:17:09,475 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 326 transitions, 3570 flow [2023-01-28 04:17:09,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 103.20689655172414) internal successors, (2993), 29 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have 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:17:09,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:17:09,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:17:09,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-01-28 04:17:09,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:17:09,681 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 2 more)] === [2023-01-28 04:17:09,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:17:09,682 INFO L85 PathProgramCache]: Analyzing trace with hash -642662938, now seen corresponding path program 6 times [2023-01-28 04:17:09,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:17:09,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70040691] [2023-01-28 04:17:09,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:17:09,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:17:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:17:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:17:10,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:17:10,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70040691] [2023-01-28 04:17:10,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70040691] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:17:10,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638053525] [2023-01-28 04:17:10,162 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 04:17:10,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:17:10,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:17:10,163 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:17:10,166 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:17:10,479 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-28 04:17:10,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:17:10,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 27 conjunts are in the unsatisfiable core [2023-01-28 04:17:10,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:17:10,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-01-28 04:17:10,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-01-28 04:17:10,682 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:17:10,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:17:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:17:11,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638053525] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:17:11,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:17:11,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 22 [2023-01-28 04:17:11,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070495554] [2023-01-28 04:17:11,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:17:11,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 04:17:11,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:17:11,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 04:17:11,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2023-01-28 04:17:11,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 296 [2023-01-28 04:17:11,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 326 transitions, 3570 flow. Second operand has 23 states, 23 states have (on average 107.43478260869566) internal successors, (2471), 23 states have internal predecessors, (2471), 0 states have call successors, (0), 0 states have 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:17:11,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:17:11,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 296 [2023-01-28 04:17:11,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:17:25,056 INFO L130 PetriNetUnfolder]: 42359/59505 cut-off events. [2023-01-28 04:17:25,056 INFO L131 PetriNetUnfolder]: For 4020271/4020271 co-relation queries the response was YES. [2023-01-28 04:17:25,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631787 conditions, 59505 events. 42359/59505 cut-off events. For 4020271/4020271 co-relation queries the response was YES. Maximal size of possible extension queue 2135. Compared 380849 event pairs, 6238 based on Foata normal form. 33/59537 useless extension candidates. Maximal degree in co-relation 631687. Up to 26973 conditions per place. [2023-01-28 04:17:26,091 INFO L137 encePairwiseOnDemand]: 282/296 looper letters, 621 selfloop transitions, 352 changer transitions 737/1710 dead transitions. [2023-01-28 04:17:26,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 1710 transitions, 27613 flow [2023-01-28 04:17:26,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-01-28 04:17:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2023-01-28 04:17:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 7590 transitions. [2023-01-28 04:17:26,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39449064449064447 [2023-01-28 04:17:26,101 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 7590 transitions. [2023-01-28 04:17:26,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 7590 transitions. [2023-01-28 04:17:26,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:17:26,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 7590 transitions. [2023-01-28 04:17:26,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 66 states, 65 states have (on average 116.76923076923077) internal successors, (7590), 65 states have internal predecessors, (7590), 0 states have call successors, (0), 0 states have 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:17:26,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 66 states, 66 states have (on average 296.0) internal successors, (19536), 66 states have internal predecessors, (19536), 0 states have call successors, (0), 0 states have 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:17:26,137 INFO L81 ComplementDD]: Finished complementDD. Result has 66 states, 66 states have (on average 296.0) internal successors, (19536), 66 states have internal predecessors, (19536), 0 states have call successors, (0), 0 states have 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:17:26,137 INFO L175 Difference]: Start difference. First operand has 216 places, 326 transitions, 3570 flow. Second operand 65 states and 7590 transitions. [2023-01-28 04:17:26,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 1710 transitions, 27613 flow [2023-01-28 04:17:55,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 1710 transitions, 21595 flow, removed 3000 selfloop flow, removed 43 redundant places. [2023-01-28 04:17:55,223 INFO L231 Difference]: Finished difference. Result has 230 places, 608 transitions, 7973 flow [2023-01-28 04:17:55,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=3155, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=7973, PETRI_PLACES=230, PETRI_TRANSITIONS=608} [2023-01-28 04:17:55,224 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 190 predicate places. [2023-01-28 04:17:55,224 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 608 transitions, 7973 flow [2023-01-28 04:17:55,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 107.43478260869566) internal successors, (2471), 23 states have internal predecessors, (2471), 0 states have call successors, (0), 0 states have 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:17:55,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:17:55,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:17:55,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-01-28 04:17:55,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:17:55,426 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 2 more)] === [2023-01-28 04:17:55,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:17:55,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1014827836, now seen corresponding path program 7 times [2023-01-28 04:17:55,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:17:55,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706511845] [2023-01-28 04:17:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:17:55,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:17:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:17:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:17:55,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:17:55,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706511845] [2023-01-28 04:17:55,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706511845] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:17:55,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847069458] [2023-01-28 04:17:55,837 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 04:17:55,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:17:55,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:17:55,841 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:17:55,845 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:17:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:17:55,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 33 conjunts are in the unsatisfiable core [2023-01-28 04:17:55,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:17:56,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-01-28 04:17:56,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-01-28 04:17:56,174 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:17:56,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:17:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:17:56,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847069458] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:17:56,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:17:56,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 25 [2023-01-28 04:17:56,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220809552] [2023-01-28 04:17:56,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:17:56,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-01-28 04:17:56,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:17:56,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-01-28 04:17:56,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2023-01-28 04:17:56,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 296 [2023-01-28 04:17:56,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 608 transitions, 7973 flow. Second operand has 26 states, 26 states have (on average 107.15384615384616) internal successors, (2786), 26 states have internal predecessors, (2786), 0 states have call successors, (0), 0 states have 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:17:56,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:17:56,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 296 [2023-01-28 04:17:56,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:18:18,436 INFO L130 PetriNetUnfolder]: 64739/91274 cut-off events. [2023-01-28 04:18:18,437 INFO L131 PetriNetUnfolder]: For 3874934/3874934 co-relation queries the response was YES. [2023-01-28 04:18:19,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813623 conditions, 91274 events. 64739/91274 cut-off events. For 3874934/3874934 co-relation queries the response was YES. Maximal size of possible extension queue 3324. Compared 620803 event pairs, 11017 based on Foata normal form. 100/91373 useless extension candidates. Maximal degree in co-relation 813515. Up to 40903 conditions per place. [2023-01-28 04:18:19,915 INFO L137 encePairwiseOnDemand]: 283/296 looper letters, 600 selfloop transitions, 403 changer transitions 1257/2260 dead transitions. [2023-01-28 04:18:19,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 2260 transitions, 35103 flow [2023-01-28 04:18:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-01-28 04:18:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2023-01-28 04:18:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 7795 transitions. [2023-01-28 04:18:19,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3930516337232755 [2023-01-28 04:18:19,926 INFO L72 ComplementDD]: Start complementDD. Operand 67 states and 7795 transitions. [2023-01-28 04:18:19,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 7795 transitions. [2023-01-28 04:18:19,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:18:19,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 7795 transitions. [2023-01-28 04:18:19,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 68 states, 67 states have (on average 116.34328358208955) internal successors, (7795), 67 states have internal predecessors, (7795), 0 states have call successors, (0), 0 states have 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:18:19,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 68 states, 68 states have (on average 296.0) internal successors, (20128), 68 states have internal predecessors, (20128), 0 states have call successors, (0), 0 states have 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:18:19,956 INFO L81 ComplementDD]: Finished complementDD. Result has 68 states, 68 states have (on average 296.0) internal successors, (20128), 68 states have internal predecessors, (20128), 0 states have call successors, (0), 0 states have 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:18:19,956 INFO L175 Difference]: Start difference. First operand has 230 places, 608 transitions, 7973 flow. Second operand 67 states and 7795 transitions. [2023-01-28 04:18:19,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 2260 transitions, 35103 flow [2023-01-28 04:18:59,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 2260 transitions, 33212 flow, removed 874 selfloop flow, removed 26 redundant places. [2023-01-28 04:18:59,189 INFO L231 Difference]: Finished difference. Result has 293 places, 780 transitions, 11685 flow [2023-01-28 04:18:59,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=7496, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=11685, PETRI_PLACES=293, PETRI_TRANSITIONS=780} [2023-01-28 04:18:59,190 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 253 predicate places. [2023-01-28 04:18:59,190 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 780 transitions, 11685 flow [2023-01-28 04:18:59,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 107.15384615384616) internal successors, (2786), 26 states have internal predecessors, (2786), 0 states have call successors, (0), 0 states have 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:18:59,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:18:59,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:18:59,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 04:18:59,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-01-28 04:18:59,391 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 2 more)] === [2023-01-28 04:18:59,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:18:59,392 INFO L85 PathProgramCache]: Analyzing trace with hash 571298132, now seen corresponding path program 8 times [2023-01-28 04:18:59,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:18:59,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178939472] [2023-01-28 04:18:59,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:18:59,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:18:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:19:00,101 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:19:00,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:19:00,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178939472] [2023-01-28 04:19:00,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178939472] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:19:00,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463626907] [2023-01-28 04:19:00,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 04:19:00,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:19:00,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:19:00,103 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:19:00,109 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:19:00,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 04:19:00,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:19:00,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 04:19:00,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:19:00,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:19:00,474 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:19:00,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-01-28 04:19:00,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-01-28 04:19:00,625 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:19:00,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:19:01,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2023-01-28 04:19:01,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-01-28 04:19:07,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 04:19:07,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463626907] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:19:07,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:19:07,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 35 [2023-01-28 04:19:07,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724774010] [2023-01-28 04:19:07,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:19:07,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-01-28 04:19:07,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:19:07,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-01-28 04:19:07,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1102, Unknown=15, NotChecked=0, Total=1332 [2023-01-28 04:19:07,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 296 [2023-01-28 04:19:07,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 780 transitions, 11685 flow. Second operand has 37 states, 37 states have (on average 98.51351351351352) internal successors, (3645), 37 states have internal predecessors, (3645), 0 states have call successors, (0), 0 states have 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:19:07,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:19:07,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 296 [2023-01-28 04:19:07,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:19:39,836 INFO L130 PetriNetUnfolder]: 65149/92079 cut-off events. [2023-01-28 04:19:39,837 INFO L131 PetriNetUnfolder]: For 9593894/9593894 co-relation queries the response was YES. [2023-01-28 04:19:41,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041888 conditions, 92079 events. 65149/92079 cut-off events. For 9593894/9593894 co-relation queries the response was YES. Maximal size of possible extension queue 3160. Compared 628947 event pairs, 7516 based on Foata normal form. 91/92169 useless extension candidates. Maximal degree in co-relation 1041749. Up to 41053 conditions per place. [2023-01-28 04:19:41,493 INFO L137 encePairwiseOnDemand]: 283/296 looper letters, 574 selfloop transitions, 555 changer transitions 1441/2570 dead transitions. [2023-01-28 04:19:41,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 2570 transitions, 47416 flow [2023-01-28 04:19:41,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2023-01-28 04:19:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2023-01-28 04:19:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 10140 transitions. [2023-01-28 04:19:41,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36059743954480794 [2023-01-28 04:19:41,505 INFO L72 ComplementDD]: Start complementDD. Operand 95 states and 10140 transitions. [2023-01-28 04:19:41,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 10140 transitions. [2023-01-28 04:19:41,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:19:41,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 95 states and 10140 transitions. [2023-01-28 04:19:41,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 96 states, 95 states have (on average 106.73684210526316) internal successors, (10140), 95 states have internal predecessors, (10140), 0 states have call successors, (0), 0 states have 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:19:41,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 96 states, 96 states have (on average 296.0) internal successors, (28416), 96 states have internal predecessors, (28416), 0 states have call successors, (0), 0 states have 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:19:41,745 INFO L81 ComplementDD]: Finished complementDD. Result has 96 states, 96 states have (on average 296.0) internal successors, (28416), 96 states have internal predecessors, (28416), 0 states have call successors, (0), 0 states have 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:19:41,745 INFO L175 Difference]: Start difference. First operand has 293 places, 780 transitions, 11685 flow. Second operand 95 states and 10140 transitions. [2023-01-28 04:19:41,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 2570 transitions, 47416 flow [2023-01-28 04:21:09,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 2570 transitions, 43211 flow, removed 2082 selfloop flow, removed 29 redundant places. [2023-01-28 04:21:09,281 INFO L231 Difference]: Finished difference. Result has 402 places, 924 transitions, 15942 flow [2023-01-28 04:21:09,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=10916, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=427, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=95, PETRI_FLOW=15942, PETRI_PLACES=402, PETRI_TRANSITIONS=924} [2023-01-28 04:21:09,283 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 362 predicate places. [2023-01-28 04:21:09,283 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 924 transitions, 15942 flow [2023-01-28 04:21:09,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 98.51351351351352) internal successors, (3645), 37 states have internal predecessors, (3645), 0 states have call successors, (0), 0 states have 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:21:09,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:21:09,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:21:09,293 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:21:09,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:21:09,490 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 2 more)] === [2023-01-28 04:21:09,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:21:09,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1216105312, now seen corresponding path program 9 times [2023-01-28 04:21:09,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:21:09,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993050960] [2023-01-28 04:21:09,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:21:09,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:21:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:21:09,983 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:21:09,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:21:09,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993050960] [2023-01-28 04:21:09,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993050960] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:21:09,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564373421] [2023-01-28 04:21:09,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 04:21:09,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:21:09,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:21:09,985 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:21:10,015 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:21:10,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 04:21:10,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:21:10,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 28 conjunts are in the unsatisfiable core [2023-01-28 04:21:10,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:21:10,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2023-01-28 04:21:10,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-01-28 04:21:10,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-01-28 04:21:10,407 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:21:10,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:21:10,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2023-01-28 04:21:10,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 69 [2023-01-28 04:21:10,627 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-01-28 04:21:10,627 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 76 treesize of output 69 [2023-01-28 04:21:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:21:10,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564373421] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:21:10,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:21:10,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 24 [2023-01-28 04:21:10,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458429724] [2023-01-28 04:21:10,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:21:10,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-28 04:21:10,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:21:10,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-28 04:21:10,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2023-01-28 04:21:10,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 296 [2023-01-28 04:21:10,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 924 transitions, 15942 flow. Second operand has 25 states, 25 states have (on average 104.72) internal successors, (2618), 25 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have 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:21:10,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:21:10,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 296 [2023-01-28 04:21:10,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:21:52,342 INFO L130 PetriNetUnfolder]: 69444/98164 cut-off events. [2023-01-28 04:21:52,342 INFO L131 PetriNetUnfolder]: For 25942294/25942294 co-relation queries the response was YES. [2023-01-28 04:21:54,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1740213 conditions, 98164 events. 69444/98164 cut-off events. For 25942294/25942294 co-relation queries the response was YES. Maximal size of possible extension queue 3265. Compared 679015 event pairs, 9871 based on Foata normal form. 35/98198 useless extension candidates. Maximal degree in co-relation 1740018. Up to 43582 conditions per place. [2023-01-28 04:21:55,264 INFO L137 encePairwiseOnDemand]: 285/296 looper letters, 596 selfloop transitions, 640 changer transitions 1172/2408 dead transitions. [2023-01-28 04:21:55,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 2408 transitions, 51867 flow [2023-01-28 04:21:55,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-28 04:21:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-01-28 04:21:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3611 transitions. [2023-01-28 04:21:55,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38122888513513514 [2023-01-28 04:21:55,268 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 3611 transitions. [2023-01-28 04:21:55,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 3611 transitions. [2023-01-28 04:21:55,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 04:21:55,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 3611 transitions. [2023-01-28 04:21:55,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 112.84375) internal successors, (3611), 32 states have internal predecessors, (3611), 0 states have call successors, (0), 0 states have 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:21:55,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 296.0) internal successors, (9768), 33 states have internal predecessors, (9768), 0 states have call successors, (0), 0 states have 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:21:55,281 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 296.0) internal successors, (9768), 33 states have internal predecessors, (9768), 0 states have call successors, (0), 0 states have 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:21:55,281 INFO L175 Difference]: Start difference. First operand has 402 places, 924 transitions, 15942 flow. Second operand 32 states and 3611 transitions. [2023-01-28 04:21:55,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 2408 transitions, 51867 flow [2023-01-28 04:26:58,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 2408 transitions, 45635 flow, removed 3096 selfloop flow, removed 62 redundant places. [2023-01-28 04:26:58,585 INFO L231 Difference]: Finished difference. Result has 330 places, 1075 transitions, 19864 flow [2023-01-28 04:26:58,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=14586, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=924, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=470, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=19864, PETRI_PLACES=330, PETRI_TRANSITIONS=1075} [2023-01-28 04:26:58,586 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 290 predicate places. [2023-01-28 04:26:58,586 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 1075 transitions, 19864 flow [2023-01-28 04:26:58,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 104.72) internal successors, (2618), 25 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have 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:26:58,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 04:26:58,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 04:26:58,593 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:26:58,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:26:58,787 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 2 more)] === [2023-01-28 04:26:58,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 04:26:58,788 INFO L85 PathProgramCache]: Analyzing trace with hash 922357864, now seen corresponding path program 10 times [2023-01-28 04:26:58,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 04:26:58,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4545887] [2023-01-28 04:26:58,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 04:26:58,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 04:26:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 04:26:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 04:26:59,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 04:26:59,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4545887] [2023-01-28 04:26:59,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4545887] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 04:26:59,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291999766] [2023-01-28 04:26:59,242 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 04:26:59,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 04:26:59,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 04:26:59,244 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:26:59,247 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:26:59,387 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 04:26:59,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 04:26:59,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 34 conjunts are in the unsatisfiable core [2023-01-28 04:26:59,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 04:26:59,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:26:59,487 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:26:59,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-01-28 04:26:59,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 04:26:59,633 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 16 treesize of output 18 [2023-01-28 04:26:59,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-01-28 04:26:59,733 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:26:59,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 04:26:59,983 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_717 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (+ (* 4 |c_thread3Thread1of1ForFork0_~i~2#1|) c_~A~0.offset))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_717) (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 .cse1 v_ArrVal_717)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_718) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))))) (<= 2147483647 c_~max~0)) is different from false [2023-01-28 04:27:00,335 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_715))) (let ((.cse2 (select .cse1 c_~A~0.base))) (let ((.cse0 (select .cse2 c_~A~0.offset))) (or (<= c_~max~0 .cse0) (< (+ .cse0 1) v_ArrVal_717) (<= (select (select (store (store .cse1 c_~A~0.base (store .cse2 c_~A~0.offset v_ArrVal_717)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_718) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)))))))) (forall ((v_ArrVal_715 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_715))) (let ((.cse5 (select .cse4 c_~A~0.base))) (let ((.cse3 (select .cse5 c_~A~0.offset))) (or (< .cse3 c_~max~0) (<= 2147483647 .cse3) (forall ((v_ArrVal_717 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse6 (+ .cse3 1))) (or (<= (select (select (store (store .cse4 c_~A~0.base (store .cse5 c_~A~0.offset v_ArrVal_717)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_718) c_~A~0.base) c_~A~0.offset) .cse6) (< .cse6 v_ArrVal_717)))))))))) is different from false [2023-01-28 04:27:00,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 213 [2023-01-28 04:27:00,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 143 [2023-01-28 04:27:00,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 133 [2023-01-28 04:27:00,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 131 [2023-01-28 04:27:00,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 127 [2023-01-28 04:27:00,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-01-28 04:27:00,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291999766] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 04:27:00,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 04:27:00,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 35 [2023-01-28 04:27:00,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744249555] [2023-01-28 04:27:00,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 04:27:00,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-01-28 04:27:00,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 04:27:00,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-01-28 04:27:00,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=988, Unknown=15, NotChecked=134, Total=1332 [2023-01-28 04:27:00,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 296 [2023-01-28 04:27:00,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 1075 transitions, 19864 flow. Second operand has 37 states, 37 states have (on average 99.48648648648648) internal successors, (3681), 37 states have internal predecessors, (3681), 0 states have call successors, (0), 0 states have 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:27:00,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 04:27:00,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 296 [2023-01-28 04:27:00,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 04:27:17,689 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 04:27:19,698 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 04:27:21,703 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 04:27:23,710 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 04:27:43,568 WARN L222 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 77 DAG size of output: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 04:27:46,038 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 04:27:48,044 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 04:27:50,050 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 04:27:54,120 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 04:27:56,124 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 04:27:58,130 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 04:28:00,368 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 04:28:02,372 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 04:28:04,379 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 04:28:28,200 WARN L222 SmtUtils]: Spent 13.74s on a formula simplification. DAG size of input: 55 DAG size of output: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 04:28:30,205 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 04:28:32,211 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 04:28:34,218 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 04:28:39,688 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 04:28:41,693 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 04:28:43,699 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 04:28:45,703 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 04:28:47,708 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 04:28:49,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 04:28:51,889 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 04:28:53,893 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 04:28:55,959 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 04:28:57,965 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 04:28:59,970 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 04:29:01,983 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 04:29:03,989 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 04:29:05,999 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 04:29:08,008 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 04:29:10,015 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 04:29:12,020 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 04:29:14,029 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 04:29:16,034 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 04:29:18,042 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 04:29:27,398 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 04:29:29,404 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 04:29:31,413 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 04:29:44,260 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 04:29:46,265 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 04:29:48,271 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 04:29:50,275 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 04:29:52,292 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 04:29:54,297 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 04:29:56,302 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 04:29:58,308 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] Received shutdown request... [2023-01-28 04:29:59,836 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 04:29:59,836 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 04:30:00,314 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 04:30:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-01-28 04:30:00,397 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 04:30:00,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-28 04:30:00,598 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,SelfDestructingSolverStorable13 [2023-01-28 04:30:00,598 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (37states, 97/296 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 123090 conditions, 9053 events (6086/9052 cut-off events. For 1118142/1118142 co-relation queries the response was YES. Maximal size of possible extension queue 2128. Compared 64278 event pairs, 299 based on Foata normal form. 0/11184 useless extension candidates. Maximal degree in co-relation 122944. Up to 4095 conditions per place.). [2023-01-28 04:30:00,600 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-01-28 04:30:00,600 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 04:30:00,600 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 04:30:00,600 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-01-28 04:30:00,600 INFO L445 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1, 1] [2023-01-28 04:30:00,603 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 04:30:00,603 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 04:30:00,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 04:30:00 BasicIcfg [2023-01-28 04:30:00,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 04:30:00,605 INFO L158 Benchmark]: Toolchain (without parser) took 813559.96ms. Allocated memory was 528.5MB in the beginning and 14.9GB in the end (delta: 14.3GB). Free memory was 483.7MB in the beginning and 9.4GB in the end (delta: -8.9GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. [2023-01-28 04:30:00,605 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 404.8MB. Free memory is still 349.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 04:30:00,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.39ms. Allocated memory is still 528.5MB. Free memory was 483.7MB in the beginning and 471.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-28 04:30:00,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.14ms. Allocated memory is still 528.5MB. Free memory was 471.1MB in the beginning and 469.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 04:30:00,606 INFO L158 Benchmark]: Boogie Preprocessor took 29.10ms. Allocated memory is still 528.5MB. Free memory was 469.0MB in the beginning and 466.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 04:30:00,606 INFO L158 Benchmark]: RCFGBuilder took 567.39ms. Allocated memory is still 528.5MB. Free memory was 466.9MB in the beginning and 441.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 04:30:00,606 INFO L158 Benchmark]: TraceAbstraction took 812618.73ms. Allocated memory was 528.5MB in the beginning and 14.9GB in the end (delta: 14.3GB). Free memory was 440.8MB in the beginning and 9.4GB in the end (delta: -8.9GB). Peak memory consumption was 5.4GB. Max. memory is 16.0GB. [2023-01-28 04:30:00,607 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 404.8MB. Free memory is still 349.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 300.39ms. Allocated memory is still 528.5MB. Free memory was 483.7MB in the beginning and 471.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.14ms. Allocated memory is still 528.5MB. Free memory was 471.1MB in the beginning and 469.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.10ms. Allocated memory is still 528.5MB. Free memory was 469.0MB in the beginning and 466.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 567.39ms. Allocated memory is still 528.5MB. Free memory was 466.9MB in the beginning and 441.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 812618.73ms. Allocated memory was 528.5MB in the beginning and 14.9GB in the end (delta: 14.3GB). Free memory was 440.8MB in the beginning and 9.4GB in the end (delta: -8.9GB). Peak memory consumption was 5.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 147 PlacesBefore, 40 PlacesAfterwards, 146 TransitionsBefore, 31 TransitionsAfterwards, 2280 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 134 TotalNumberOfCompositions, 3482 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2552, independent: 2466, independent conditional: 0, independent unconditional: 2466, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1219, independent: 1190, independent conditional: 0, independent unconditional: 1190, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2552, independent: 1276, independent conditional: 0, independent unconditional: 1276, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 1219, unknown conditional: 0, unknown unconditional: 1219] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (37states, 97/296 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 123090 conditions, 9053 events (6086/9052 cut-off events. For 1118142/1118142 co-relation queries the response was YES. Maximal size of possible extension queue 2128. Compared 64278 event pairs, 299 based on Foata normal form. 0/11184 useless extension candidates. Maximal degree in co-relation 122944. Up to 4095 conditions per place.). - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (37states, 97/296 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 123090 conditions, 9053 events (6086/9052 cut-off events. For 1118142/1118142 co-relation queries the response was YES. Maximal size of possible extension queue 2128. Compared 64278 event pairs, 299 based on Foata normal form. 0/11184 useless extension candidates. Maximal degree in co-relation 122944. Up to 4095 conditions per place.). - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (37states, 97/296 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 123090 conditions, 9053 events (6086/9052 cut-off events. For 1118142/1118142 co-relation queries the response was YES. Maximal size of possible extension queue 2128. Compared 64278 event pairs, 299 based on Foata normal form. 0/11184 useless extension candidates. Maximal degree in co-relation 122944. Up to 4095 conditions per place.). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (37states, 97/296 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 123090 conditions, 9053 events (6086/9052 cut-off events. For 1118142/1118142 co-relation queries the response was YES. Maximal size of possible extension queue 2128. Compared 64278 event pairs, 299 based on Foata normal form. 0/11184 useless extension candidates. Maximal degree in co-relation 122944. Up to 4095 conditions per place.). - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (37states, 97/296 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 123090 conditions, 9053 events (6086/9052 cut-off events. For 1118142/1118142 co-relation queries the response was YES. Maximal size of possible extension queue 2128. Compared 64278 event pairs, 299 based on Foata normal form. 0/11184 useless extension candidates. Maximal degree in co-relation 122944. Up to 4095 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 190 locations, 5 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: 812.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 782.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 48 mSolverCounterUnknown, 5446 SdHoareTripleChecker+Valid, 110.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5446 mSDsluCounter, 366 SdHoareTripleChecker+Invalid, 107.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5519 IncrementalHoareTripleChecker+Unchecked, 325 mSDsCounter, 648 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16741 IncrementalHoareTripleChecker+Invalid, 22956 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 648 mSolverCounterUnsat, 41 mSDtfsCounter, 16741 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1289 GetRequests, 532 SyntacticMatches, 75 SemanticMatches, 682 ConstructedPredicates, 9 IntricatePredicates, 8 DeprecatedPredicates, 21983 ImplicationChecksByTransitivity, 106.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19864occurred in iteration=13, InterpolantAutomatonStates: 422, 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.4s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 890 ConstructedInterpolants, 38 QuantifiedInterpolants, 9975 SizeOfPredicates, 124 NumberOfNonLiveVariables, 2320 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 57/110 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