/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 22:08:40,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 22:08:40,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 22:08:40,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 22:08:40,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 22:08:40,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 22:08:40,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 22:08:40,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 22:08:40,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 22:08:40,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 22:08:40,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 22:08:40,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 22:08:40,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 22:08:40,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 22:08:40,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 22:08:40,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 22:08:40,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 22:08:40,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 22:08:40,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 22:08:40,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 22:08:40,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 22:08:40,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 22:08:40,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 22:08:40,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 22:08:40,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 22:08:40,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 22:08:40,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 22:08:40,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 22:08:40,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 22:08:40,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 22:08:40,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 22:08:40,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 22:08:40,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 22:08:40,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 22:08:40,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 22:08:40,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 22:08:40,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 22:08:40,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 22:08:40,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 22:08:40,391 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 22:08:40,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 22:08:40,394 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 22:08:40,422 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 22:08:40,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 22:08:40,423 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 22:08:40,423 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 22:08:40,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 22:08:40,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 22:08:40,424 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 22:08:40,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 22:08:40,425 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 22:08:40,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 22:08:40,425 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 22:08:40,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 22:08:40,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 22:08:40,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 22:08:40,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 22:08:40,426 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 22:08:40,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 22:08:40,426 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 22:08:40,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 22:08:40,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 22:08:40,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 22:08:40,427 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 22:08:40,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 22:08:40,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 22:08:40,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 22:08:40,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 22:08:40,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 22:08:40,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 22:08:40,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 22:08:40,428 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 22:08:40,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 22:08:40,428 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-01-27 22:08:40,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 22:08:40,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 22:08:40,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 22:08:40,656 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 22:08:40,656 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 22:08:40,657 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-01-27 22:08:41,709 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 22:08:41,892 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 22:08:41,893 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-01-27 22:08:41,897 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/033e1e7b7/e9baeb8f8d144998862e615116911442/FLAGd2e3f09a7 [2023-01-27 22:08:41,908 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/033e1e7b7/e9baeb8f8d144998862e615116911442 [2023-01-27 22:08:41,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 22:08:41,911 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 22:08:41,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 22:08:41,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 22:08:41,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 22:08:41,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 10:08:41" (1/1) ... [2023-01-27 22:08:41,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7623f646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:08:41, skipping insertion in model container [2023-01-27 22:08:41,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 10:08:41" (1/1) ... [2023-01-27 22:08:41,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 22:08:41,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 22:08:42,108 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2023-01-27 22:08:42,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 22:08:42,135 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 22:08:42,173 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2023-01-27 22:08:42,176 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 22:08:42,182 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 22:08:42,183 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 22:08:42,191 INFO L208 MainTranslator]: Completed translation [2023-01-27 22:08:42,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:08:42 WrapperNode [2023-01-27 22:08:42,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 22:08:42,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 22:08:42,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 22:08:42,194 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 22:08:42,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:08:42" (1/1) ... [2023-01-27 22:08:42,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:08:42" (1/1) ... [2023-01-27 22:08:42,243 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-01-27 22:08:42,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 22:08:42,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 22:08:42,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 22:08:42,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 22:08:42,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:08:42" (1/1) ... [2023-01-27 22:08:42,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:08:42" (1/1) ... [2023-01-27 22:08:42,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:08:42" (1/1) ... [2023-01-27 22:08:42,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:08:42" (1/1) ... [2023-01-27 22:08:42,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:08:42" (1/1) ... [2023-01-27 22:08:42,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:08:42" (1/1) ... [2023-01-27 22:08:42,277 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:08:42" (1/1) ... [2023-01-27 22:08:42,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:08:42" (1/1) ... [2023-01-27 22:08:42,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 22:08:42,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 22:08:42,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 22:08:42,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 22:08:42,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:08:42" (1/1) ... [2023-01-27 22:08:42,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 22:08:42,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:08:42,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 22:08:42,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 22:08:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 22:08:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 22:08:42,358 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 22:08:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 22:08:42,358 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 22:08:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-27 22:08:42,359 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-27 22:08:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 22:08:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 22:08:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 22:08:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 22:08:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 22:08:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 22:08:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 22:08:42,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 22:08:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 22:08:42,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 22:08:42,361 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 22:08:42,491 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 22:08:42,493 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 22:08:42,736 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 22:08:42,805 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 22:08:42,805 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-27 22:08:42,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 10:08:42 BoogieIcfgContainer [2023-01-27 22:08:42,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 22:08:42,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 22:08:42,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 22:08:42,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 22:08:42,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 10:08:41" (1/3) ... [2023-01-27 22:08:42,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a79ed0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 10:08:42, skipping insertion in model container [2023-01-27 22:08:42,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:08:42" (2/3) ... [2023-01-27 22:08:42,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a79ed0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 10:08:42, skipping insertion in model container [2023-01-27 22:08:42,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 10:08:42" (3/3) ... [2023-01-27 22:08:42,819 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2023-01-27 22:08:42,862 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 22:08:42,863 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 22:08:42,863 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 22:08:42,959 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-27 22:08:42,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 145 transitions, 314 flow [2023-01-27 22:08:43,074 INFO L130 PetriNetUnfolder]: 12/142 cut-off events. [2023-01-27 22:08:43,074 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 22:08:43,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 12/142 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 88 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-01-27 22:08:43,080 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 145 transitions, 314 flow [2023-01-27 22:08:43,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 132 transitions, 282 flow [2023-01-27 22:08:43,095 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 22:08:43,103 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 132 transitions, 282 flow [2023-01-27 22:08:43,105 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 132 transitions, 282 flow [2023-01-27 22:08:43,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 132 transitions, 282 flow [2023-01-27 22:08:43,157 INFO L130 PetriNetUnfolder]: 12/132 cut-off events. [2023-01-27 22:08:43,158 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 22:08:43,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 12/132 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-01-27 22:08:43,162 INFO L119 LiptonReduction]: Number of co-enabled transitions 1320 [2023-01-27 22:08:47,782 INFO L134 LiptonReduction]: Checked pairs total: 1523 [2023-01-27 22:08:47,782 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-01-27 22:08:47,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 22:08:47,801 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;@30f4b898, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 22:08:47,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-27 22:08:47,807 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2023-01-27 22:08:47,807 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 22:08:47,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:08:47,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:08:47,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:08:47,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:08:47,813 INFO L85 PathProgramCache]: Analyzing trace with hash -924859563, now seen corresponding path program 1 times [2023-01-27 22:08:47,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:08:47,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776913251] [2023-01-27 22:08:47,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:08:47,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:08:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:08:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:08:48,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:08:48,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776913251] [2023-01-27 22:08:48,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776913251] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:08:48,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:08:48,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 22:08:48,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821938284] [2023-01-27 22:08:48,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:08:48,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 22:08:48,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:08:48,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 22:08:48,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 22:08:48,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 267 [2023-01-27 22:08:48,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:08:48,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:08:48,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 267 [2023-01-27 22:08:48,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:08:48,997 INFO L130 PetriNetUnfolder]: 514/733 cut-off events. [2023-01-27 22:08:48,997 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2023-01-27 22:08:49,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 733 events. 514/733 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2552 event pairs, 137 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 1179. Up to 348 conditions per place. [2023-01-27 22:08:49,007 INFO L137 encePairwiseOnDemand]: 259/267 looper letters, 50 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2023-01-27 22:08:49,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 62 transitions, 288 flow [2023-01-27 22:08:49,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 22:08:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 22:08:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 848 transitions. [2023-01-27 22:08:49,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3970037453183521 [2023-01-27 22:08:49,027 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 848 transitions. [2023-01-27 22:08:49,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 848 transitions. [2023-01-27 22:08:49,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:08:49,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 848 transitions. [2023-01-27 22:08:49,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:08:49,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:08:49,047 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:08:49,049 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 8 states and 848 transitions. [2023-01-27 22:08:49,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 62 transitions, 288 flow [2023-01-27 22:08:49,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 62 transitions, 260 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-01-27 22:08:49,056 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 118 flow [2023-01-27 22:08:49,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=118, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2023-01-27 22:08:49,060 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-01-27 22:08:49,060 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 118 flow [2023-01-27 22:08:49,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:08:49,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:08:49,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:08:49,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 22:08:49,063 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:08:49,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:08:49,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1563909876, now seen corresponding path program 1 times [2023-01-27 22:08:49,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:08:49,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309465913] [2023-01-27 22:08:49,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:08:49,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:08:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:08:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:08:49,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:08:49,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309465913] [2023-01-27 22:08:49,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309465913] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:08:49,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72318189] [2023-01-27 22:08:49,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:08:49,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:08:49,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:08:49,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:08:49,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-27 22:08:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:08:49,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-27 22:08:49,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:08:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:08:49,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:08:49,478 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-27 22:08:49,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72318189] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 22:08:49,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 22:08:49,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-01-27 22:08:49,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403206920] [2023-01-27 22:08:49,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:08:49,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 22:08:49,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:08:49,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 22:08:49,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-01-27 22:08:49,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 267 [2023-01-27 22:08:49,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:08:49,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:08:49,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 267 [2023-01-27 22:08:49,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:08:49,629 INFO L130 PetriNetUnfolder]: 451/682 cut-off events. [2023-01-27 22:08:49,630 INFO L131 PetriNetUnfolder]: For 378/418 co-relation queries the response was YES. [2023-01-27 22:08:49,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 682 events. 451/682 cut-off events. For 378/418 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2501 event pairs, 114 based on Foata normal form. 30/596 useless extension candidates. Maximal degree in co-relation 1921. Up to 527 conditions per place. [2023-01-27 22:08:49,634 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 37 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-01-27 22:08:49,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 256 flow [2023-01-27 22:08:49,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 22:08:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 22:08:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2023-01-27 22:08:49,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41872659176029964 [2023-01-27 22:08:49,637 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 559 transitions. [2023-01-27 22:08:49,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 559 transitions. [2023-01-27 22:08:49,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:08:49,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 559 transitions. [2023-01-27 22:08:49,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:08:49,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:08:49,642 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:08:49,642 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 118 flow. Second operand 5 states and 559 transitions. [2023-01-27 22:08:49,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 256 flow [2023-01-27 22:08:49,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 245 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-01-27 22:08:49,645 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 127 flow [2023-01-27 22:08:49,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-01-27 22:08:49,646 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2023-01-27 22:08:49,646 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 127 flow [2023-01-27 22:08:49,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:08:49,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:08:49,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:08:49,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-27 22:08:49,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:08:49,853 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:08:49,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:08:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1717822039, now seen corresponding path program 1 times [2023-01-27 22:08:49,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:08:49,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340505417] [2023-01-27 22:08:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:08:49,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:08:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:08:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:08:51,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:08:51,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340505417] [2023-01-27 22:08:51,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340505417] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:08:51,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568616733] [2023-01-27 22:08:51,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:08:51,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:08:51,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:08:51,369 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:08:51,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-27 22:08:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:08:51,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 47 conjunts are in the unsatisfiable core [2023-01-27 22:08:51,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:08:51,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 22:08:51,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 22:08:51,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 22:08:51,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 22:08:52,177 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-01-27 22:08:52,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 59 [2023-01-27 22:08:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:08:52,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:08:53,664 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (<= c_~min2~0 c_~min3~0)) (.cse5 (= c_~min2~0 c_~min1~0)) (.cse6 (< c_~min3~0 c_~min2~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse3)) (.cse1 (select .cse2 c_~A~0.offset))) (or (<= c_~min3~0 .cse0) (= .cse1 .cse0) (<= c_~min2~0 .cse0) (<= c_~min1~0 .cse1))))) (or (and (or .cse4 (= c_~min1~0 c_~min3~0)) (or .cse5 .cse6)) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (or (< (select .cse7 c_~A~0.offset) c_~min1~0) (< (select .cse7 .cse3) c_~min3~0))))) (or .cse4 (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse8 (select .cse9 c_~A~0.offset))) (or (= .cse8 c_~min3~0) (< (select .cse9 .cse3) c_~min3~0) (<= c_~min1~0 .cse8)))))) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse11 (select .cse10 .cse3))) (or (< (select .cse10 c_~A~0.offset) c_~min1~0) (<= c_~min3~0 .cse11) (= c_~min1~0 .cse11) (<= c_~min2~0 .cse11))))) (or .cse5 (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse13 (select .cse12 .cse3))) (or (< (select .cse12 c_~A~0.offset) c_~min1~0) (<= c_~min3~0 .cse13) (< .cse13 c_~min2~0)))))) (or (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse15 (select .cse14 c_~A~0.offset))) (or (< (select .cse14 .cse3) c_~min3~0) (= c_~min2~0 .cse15) (<= c_~min1~0 .cse15))))) .cse6) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse17 (select .cse18 c_~A~0.offset)) (.cse16 (select .cse18 .cse3))) (or (<= c_~min3~0 .cse16) (= c_~min2~0 .cse17) (<= c_~min1~0 .cse17) (< .cse16 c_~min2~0))))))) is different from false [2023-01-27 22:08:53,896 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (<= c_~min2~0 c_~min3~0)) (.cse6 (= c_~min2~0 c_~min1~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse15 (< c_~min3~0 c_~min2~0))) (and (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse2))) (or (= c_~min1~0 .cse0) (<= c_~min2~0 .cse0) (<= c_~min3~0 .cse0) (< (select .cse1 c_~A~0.offset) c_~min1~0))))) (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse3 (select .cse5 c_~A~0.offset)) (.cse4 (select .cse5 .cse2))) (or (= c_~min2~0 .cse3) (<= c_~min1~0 .cse3) (< .cse4 c_~min2~0) (<= c_~min3~0 .cse4))))) (or .cse6 (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse2))) (or (< .cse7 c_~min2~0) (<= c_~min3~0 .cse7) (< (select .cse8 c_~A~0.offset) c_~min1~0)))))) (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse9 (select .cse11 c_~A~0.offset)) (.cse10 (select .cse11 .cse2))) (or (<= c_~min1~0 .cse9) (<= c_~min2~0 .cse10) (= .cse9 .cse10) (<= c_~min3~0 .cse10))))) (or .cse12 (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse13 (select .cse14 c_~A~0.offset))) (or (<= c_~min1~0 .cse13) (< (select .cse14 .cse2) c_~min3~0) (= c_~min3~0 .cse13)))))) (or (and (or .cse12 (= c_~min1~0 c_~min3~0)) (or .cse6 .cse15)) (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (or (< (select .cse16 .cse2) c_~min3~0) (< (select .cse16 c_~A~0.offset) c_~min1~0))))) (or (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse17 (select .cse18 c_~A~0.offset))) (or (= c_~min2~0 .cse17) (<= c_~min1~0 .cse17) (< (select .cse18 .cse2) c_~min3~0))))) .cse15))) is different from false [2023-01-27 22:08:55,070 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:08:55,070 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 125 treesize of output 89 [2023-01-27 22:08:55,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:08:55,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 541 treesize of output 521 [2023-01-27 22:08:55,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:08:55,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 513 treesize of output 441 [2023-01-27 22:08:55,140 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:08:55,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 433 treesize of output 401 [2023-01-27 22:08:55,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:08:55,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 193 [2023-01-27 22:08:57,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:08:57,340 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 121 treesize of output 85 [2023-01-27 22:08:57,363 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:08:57,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4373 treesize of output 4185 [2023-01-27 22:08:57,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:08:57,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 221 [2023-01-27 22:08:57,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:08:57,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 418 treesize of output 354 [2023-01-27 22:08:57,515 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:08:57,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 190 [2023-01-27 22:08:57,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:08:57,938 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 89 treesize of output 65 [2023-01-27 22:08:57,953 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:08:57,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 764 treesize of output 736 [2023-01-27 22:08:57,990 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:08:57,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 350 treesize of output 314 [2023-01-27 22:08:58,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:08:58,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 142 [2023-01-27 22:08:58,029 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:08:58,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 143 [2023-01-27 22:08:58,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:08:58,255 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 93 treesize of output 69 [2023-01-27 22:08:58,272 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:08:58,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1688 treesize of output 1612 [2023-01-27 22:08:58,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:08:58,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 156 [2023-01-27 22:08:58,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:08:58,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 142 [2023-01-27 22:08:58,448 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:08:58,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 143 [2023-01-27 22:08:58,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:08:58,675 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 61 treesize of output 49 [2023-01-27 22:08:58,695 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:08:58,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2187 treesize of output 2095 [2023-01-27 22:08:58,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:08:58,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 111 [2023-01-27 22:08:58,757 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:08:58,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 207 [2023-01-27 22:08:58,776 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:08:58,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 97 [2023-01-27 22:08:58,858 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:08:58,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 1 [2023-01-27 22:08:58,872 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:08:58,873 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 89 treesize of output 1 [2023-01-27 22:08:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:08:59,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568616733] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:08:59,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:08:59,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 29 [2023-01-27 22:08:59,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812296439] [2023-01-27 22:08:59,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:08:59,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-27 22:08:59,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:08:59,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-27 22:08:59,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=689, Unknown=2, NotChecked=110, Total=930 [2023-01-27 22:08:59,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 267 [2023-01-27 22:08:59,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 127 flow. Second operand has 31 states, 31 states have (on average 71.03225806451613) internal successors, (2202), 31 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:08:59,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:08:59,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 267 [2023-01-27 22:08:59,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:09:01,856 INFO L130 PetriNetUnfolder]: 1091/1613 cut-off events. [2023-01-27 22:09:01,856 INFO L131 PetriNetUnfolder]: For 1313/1313 co-relation queries the response was YES. [2023-01-27 22:09:01,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4932 conditions, 1613 events. 1091/1613 cut-off events. For 1313/1313 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6171 event pairs, 160 based on Foata normal form. 17/1414 useless extension candidates. Maximal degree in co-relation 3672. Up to 999 conditions per place. [2023-01-27 22:09:01,866 INFO L137 encePairwiseOnDemand]: 255/267 looper letters, 108 selfloop transitions, 67 changer transitions 13/188 dead transitions. [2023-01-27 22:09:01,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 188 transitions, 1077 flow [2023-01-27 22:09:01,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-01-27 22:09:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-01-27 22:09:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1906 transitions. [2023-01-27 22:09:01,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2855430711610487 [2023-01-27 22:09:01,873 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1906 transitions. [2023-01-27 22:09:01,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1906 transitions. [2023-01-27 22:09:01,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:09:01,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1906 transitions. [2023-01-27 22:09:01,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 76.24) internal successors, (1906), 25 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:01,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 267.0) internal successors, (6942), 26 states have internal predecessors, (6942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:01,887 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 267.0) internal successors, (6942), 26 states have internal predecessors, (6942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:01,887 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 127 flow. Second operand 25 states and 1906 transitions. [2023-01-27 22:09:01,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 188 transitions, 1077 flow [2023-01-27 22:09:01,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 188 transitions, 1016 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-01-27 22:09:01,895 INFO L231 Difference]: Finished difference. Result has 73 places, 96 transitions, 619 flow [2023-01-27 22:09:01,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=619, PETRI_PLACES=73, PETRI_TRANSITIONS=96} [2023-01-27 22:09:01,896 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 43 predicate places. [2023-01-27 22:09:01,896 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 96 transitions, 619 flow [2023-01-27 22:09:01,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 71.03225806451613) internal successors, (2202), 31 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:01,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:09:01,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:09:01,907 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-27 22:09:02,103 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,SelfDestructingSolverStorable2 [2023-01-27 22:09:02,104 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:09:02,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:09:02,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1797774933, now seen corresponding path program 2 times [2023-01-27 22:09:02,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:09:02,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750435965] [2023-01-27 22:09:02,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:09:02,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:09:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:09:02,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:02,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:09:02,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750435965] [2023-01-27 22:09:02,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750435965] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:09:02,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35069016] [2023-01-27 22:09:02,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:09:02,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:02,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:09:02,780 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:09:02,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-27 22:09:02,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:09:02,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:09:02,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2023-01-27 22:09:02,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:09:03,182 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:09:03,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:09:03,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 37 [2023-01-27 22:09:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:03,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:09:03,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:09:03,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 69 [2023-01-27 22:09:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:03,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35069016] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:09:03,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:09:03,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-01-27 22:09:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861383818] [2023-01-27 22:09:03,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:09:03,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-27 22:09:03,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:09:03,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-27 22:09:03,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2023-01-27 22:09:03,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 267 [2023-01-27 22:09:03,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 96 transitions, 619 flow. Second operand has 23 states, 23 states have (on average 84.6086956521739) internal successors, (1946), 23 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:03,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:09:03,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 267 [2023-01-27 22:09:03,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:09:04,984 INFO L130 PetriNetUnfolder]: 1348/2024 cut-off events. [2023-01-27 22:09:04,984 INFO L131 PetriNetUnfolder]: For 4141/4189 co-relation queries the response was YES. [2023-01-27 22:09:04,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7802 conditions, 2024 events. 1348/2024 cut-off events. For 4141/4189 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8962 event pairs, 148 based on Foata normal form. 43/2055 useless extension candidates. Maximal degree in co-relation 7735. Up to 1321 conditions per place. [2023-01-27 22:09:05,000 INFO L137 encePairwiseOnDemand]: 255/267 looper letters, 109 selfloop transitions, 69 changer transitions 4/189 dead transitions. [2023-01-27 22:09:05,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 189 transitions, 1397 flow [2023-01-27 22:09:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-27 22:09:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-27 22:09:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1014 transitions. [2023-01-27 22:09:05,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3452502553626149 [2023-01-27 22:09:05,003 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1014 transitions. [2023-01-27 22:09:05,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1014 transitions. [2023-01-27 22:09:05,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:09:05,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1014 transitions. [2023-01-27 22:09:05,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:05,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 267.0) internal successors, (3204), 12 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:05,011 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 267.0) internal successors, (3204), 12 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:05,012 INFO L175 Difference]: Start difference. First operand has 73 places, 96 transitions, 619 flow. Second operand 11 states and 1014 transitions. [2023-01-27 22:09:05,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 189 transitions, 1397 flow [2023-01-27 22:09:05,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 189 transitions, 1376 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-01-27 22:09:05,031 INFO L231 Difference]: Finished difference. Result has 86 places, 128 transitions, 1055 flow [2023-01-27 22:09:05,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1055, PETRI_PLACES=86, PETRI_TRANSITIONS=128} [2023-01-27 22:09:05,033 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2023-01-27 22:09:05,033 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 128 transitions, 1055 flow [2023-01-27 22:09:05,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 84.6086956521739) internal successors, (1946), 23 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:05,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:09:05,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:09:05,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-27 22:09:05,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:05,242 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:09:05,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:09:05,243 INFO L85 PathProgramCache]: Analyzing trace with hash 184588913, now seen corresponding path program 3 times [2023-01-27 22:09:05,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:09:05,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114351313] [2023-01-27 22:09:05,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:09:05,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:09:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:09:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:06,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:09:06,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114351313] [2023-01-27 22:09:06,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114351313] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:09:06,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017327177] [2023-01-27 22:09:06,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:09:06,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:06,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:09:06,002 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:09:06,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-27 22:09:06,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 22:09:06,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:09:06,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-27 22:09:06,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:09:06,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:09:06,443 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 34 treesize of output 32 [2023-01-27 22:09:06,578 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:09:06,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:09:06,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 37 [2023-01-27 22:09:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:06,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:09:07,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:09:07,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 177 [2023-01-27 22:09:07,150 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 141 [2023-01-27 22:09:07,155 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 141 treesize of output 129 [2023-01-27 22:09:07,159 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 129 treesize of output 111 [2023-01-27 22:09:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:07,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017327177] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:09:07,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:09:07,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 26 [2023-01-27 22:09:07,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390962211] [2023-01-27 22:09:07,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:09:07,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-01-27 22:09:07,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:09:07,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-01-27 22:09:07,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=650, Unknown=2, NotChecked=0, Total=756 [2023-01-27 22:09:07,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 267 [2023-01-27 22:09:07,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 128 transitions, 1055 flow. Second operand has 28 states, 28 states have (on average 77.28571428571429) internal successors, (2164), 28 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:07,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:09:07,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 267 [2023-01-27 22:09:07,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:09:11,828 INFO L130 PetriNetUnfolder]: 2159/3216 cut-off events. [2023-01-27 22:09:11,829 INFO L131 PetriNetUnfolder]: For 10698/10698 co-relation queries the response was YES. [2023-01-27 22:09:11,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14353 conditions, 3216 events. 2159/3216 cut-off events. For 10698/10698 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15069 event pairs, 161 based on Foata normal form. 44/3260 useless extension candidates. Maximal degree in co-relation 14314. Up to 1871 conditions per place. [2023-01-27 22:09:11,855 INFO L137 encePairwiseOnDemand]: 254/267 looper letters, 196 selfloop transitions, 121 changer transitions 2/319 dead transitions. [2023-01-27 22:09:11,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 319 transitions, 2747 flow [2023-01-27 22:09:11,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-01-27 22:09:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-01-27 22:09:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1707 transitions. [2023-01-27 22:09:11,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3196629213483146 [2023-01-27 22:09:11,862 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1707 transitions. [2023-01-27 22:09:11,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1707 transitions. [2023-01-27 22:09:11,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:09:11,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1707 transitions. [2023-01-27 22:09:11,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 85.35) internal successors, (1707), 20 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:11,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:11,874 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:11,874 INFO L175 Difference]: Start difference. First operand has 86 places, 128 transitions, 1055 flow. Second operand 20 states and 1707 transitions. [2023-01-27 22:09:11,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 319 transitions, 2747 flow [2023-01-27 22:09:11,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 319 transitions, 2714 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-01-27 22:09:11,915 INFO L231 Difference]: Finished difference. Result has 112 places, 192 transitions, 1994 flow [2023-01-27 22:09:11,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1994, PETRI_PLACES=112, PETRI_TRANSITIONS=192} [2023-01-27 22:09:11,916 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 82 predicate places. [2023-01-27 22:09:11,916 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 192 transitions, 1994 flow [2023-01-27 22:09:11,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 77.28571428571429) internal successors, (2164), 28 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:11,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:09:11,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:09:11,926 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-27 22:09:12,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:12,126 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:09:12,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:09:12,126 INFO L85 PathProgramCache]: Analyzing trace with hash -542212045, now seen corresponding path program 4 times [2023-01-27 22:09:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:09:12,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181929795] [2023-01-27 22:09:12,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:09:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:09:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:09:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:12,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:09:12,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181929795] [2023-01-27 22:09:12,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181929795] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:09:12,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007029516] [2023-01-27 22:09:12,849 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:09:12,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:12,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:09:12,851 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:09:12,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-27 22:09:12,987 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:09:12,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:09:12,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 30 conjunts are in the unsatisfiable core [2023-01-27 22:09:12,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:09:13,557 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-01-27 22:09:13,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 63 [2023-01-27 22:09:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:09:13,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:09:14,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:09:14,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 69 [2023-01-27 22:09:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:09:14,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007029516] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:09:14,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:09:14,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 23 [2023-01-27 22:09:14,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788868162] [2023-01-27 22:09:14,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:09:14,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-27 22:09:14,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:09:14,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-27 22:09:14,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2023-01-27 22:09:14,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 267 [2023-01-27 22:09:14,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 192 transitions, 1994 flow. Second operand has 25 states, 25 states have (on average 81.48) internal successors, (2037), 25 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:14,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:09:14,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 267 [2023-01-27 22:09:14,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:09:17,937 INFO L130 PetriNetUnfolder]: 3690/5659 cut-off events. [2023-01-27 22:09:17,937 INFO L131 PetriNetUnfolder]: For 33384/33384 co-relation queries the response was YES. [2023-01-27 22:09:17,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29048 conditions, 5659 events. 3690/5659 cut-off events. For 33384/33384 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 31189 event pairs, 190 based on Foata normal form. 7/5666 useless extension candidates. Maximal degree in co-relation 28999. Up to 2351 conditions per place. [2023-01-27 22:09:17,978 INFO L137 encePairwiseOnDemand]: 252/267 looper letters, 294 selfloop transitions, 282 changer transitions 36/612 dead transitions. [2023-01-27 22:09:17,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 612 transitions, 6418 flow [2023-01-27 22:09:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-01-27 22:09:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-01-27 22:09:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 3986 transitions. [2023-01-27 22:09:17,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32453997720241 [2023-01-27 22:09:17,995 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 3986 transitions. [2023-01-27 22:09:17,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 3986 transitions. [2023-01-27 22:09:18,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:09:18,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 3986 transitions. [2023-01-27 22:09:18,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 86.65217391304348) internal successors, (3986), 46 states have internal predecessors, (3986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:18,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 267.0) internal successors, (12549), 47 states have internal predecessors, (12549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:18,026 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 267.0) internal successors, (12549), 47 states have internal predecessors, (12549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:18,026 INFO L175 Difference]: Start difference. First operand has 112 places, 192 transitions, 1994 flow. Second operand 46 states and 3986 transitions. [2023-01-27 22:09:18,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 612 transitions, 6418 flow [2023-01-27 22:09:18,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 612 transitions, 6068 flow, removed 153 selfloop flow, removed 7 redundant places. [2023-01-27 22:09:18,177 INFO L231 Difference]: Finished difference. Result has 178 places, 398 transitions, 4869 flow [2023-01-27 22:09:18,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=4869, PETRI_PLACES=178, PETRI_TRANSITIONS=398} [2023-01-27 22:09:18,178 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 148 predicate places. [2023-01-27 22:09:18,178 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 398 transitions, 4869 flow [2023-01-27 22:09:18,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 81.48) internal successors, (2037), 25 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:18,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:09:18,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:09:18,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-27 22:09:18,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:18,385 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:09:18,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:09:18,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1208376447, now seen corresponding path program 5 times [2023-01-27 22:09:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:09:18,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259777467] [2023-01-27 22:09:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:09:18,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:09:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:09:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:19,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:09:19,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259777467] [2023-01-27 22:09:19,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259777467] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:09:19,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618447103] [2023-01-27 22:09:19,240 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 22:09:19,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:19,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:09:19,241 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:09:19,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-27 22:09:19,326 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-27 22:09:19,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:09:19,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjunts are in the unsatisfiable core [2023-01-27 22:09:19,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:09:19,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:09:19,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 71 [2023-01-27 22:09:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:09:20,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:09:20,358 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:09:20,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 65 [2023-01-27 22:09:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:09:20,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618447103] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:09:20,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:09:20,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 5] total 21 [2023-01-27 22:09:20,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262725926] [2023-01-27 22:09:20,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:09:20,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-27 22:09:20,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:09:20,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-27 22:09:20,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2023-01-27 22:09:20,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 267 [2023-01-27 22:09:20,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 398 transitions, 4869 flow. Second operand has 23 states, 23 states have (on average 78.6086956521739) internal successors, (1808), 23 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:20,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:09:20,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 267 [2023-01-27 22:09:20,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:09:23,425 INFO L130 PetriNetUnfolder]: 4546/7224 cut-off events. [2023-01-27 22:09:23,426 INFO L131 PetriNetUnfolder]: For 101225/101596 co-relation queries the response was YES. [2023-01-27 22:09:23,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48306 conditions, 7224 events. 4546/7224 cut-off events. For 101225/101596 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 44972 event pairs, 486 based on Foata normal form. 227/7432 useless extension candidates. Maximal degree in co-relation 48230. Up to 4394 conditions per place. [2023-01-27 22:09:23,491 INFO L137 encePairwiseOnDemand]: 253/267 looper letters, 298 selfloop transitions, 339 changer transitions 14/672 dead transitions. [2023-01-27 22:09:23,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 672 transitions, 9216 flow [2023-01-27 22:09:23,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-01-27 22:09:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-01-27 22:09:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2015 transitions. [2023-01-27 22:09:23,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3144506866416979 [2023-01-27 22:09:23,496 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2015 transitions. [2023-01-27 22:09:23,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2015 transitions. [2023-01-27 22:09:23,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:09:23,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2015 transitions. [2023-01-27 22:09:23,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 83.95833333333333) internal successors, (2015), 24 states have internal predecessors, (2015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:23,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 267.0) internal successors, (6675), 25 states have internal predecessors, (6675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:23,507 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 267.0) internal successors, (6675), 25 states have internal predecessors, (6675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:23,507 INFO L175 Difference]: Start difference. First operand has 178 places, 398 transitions, 4869 flow. Second operand 24 states and 2015 transitions. [2023-01-27 22:09:23,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 672 transitions, 9216 flow [2023-01-27 22:09:23,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 672 transitions, 8312 flow, removed 436 selfloop flow, removed 7 redundant places. [2023-01-27 22:09:23,910 INFO L231 Difference]: Finished difference. Result has 199 places, 572 transitions, 7408 flow [2023-01-27 22:09:23,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=4325, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=7408, PETRI_PLACES=199, PETRI_TRANSITIONS=572} [2023-01-27 22:09:23,910 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 169 predicate places. [2023-01-27 22:09:23,911 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 572 transitions, 7408 flow [2023-01-27 22:09:23,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 78.6086956521739) internal successors, (1808), 23 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:23,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:09:23,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:09:23,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-27 22:09:24,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:24,118 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:09:24,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:09:24,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1180941759, now seen corresponding path program 6 times [2023-01-27 22:09:24,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:09:24,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888026579] [2023-01-27 22:09:24,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:09:24,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:09:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:09:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:24,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:09:24,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888026579] [2023-01-27 22:09:24,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888026579] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:09:24,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794865347] [2023-01-27 22:09:24,730 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 22:09:24,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:24,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:09:24,731 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:09:24,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-27 22:09:24,830 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-27 22:09:24,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:09:24,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2023-01-27 22:09:24,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:09:25,240 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-01-27 22:09:25,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 59 [2023-01-27 22:09:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:25,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:09:25,589 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:09:25,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 69 [2023-01-27 22:09:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:25,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794865347] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:09:25,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:09:25,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2023-01-27 22:09:25,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853071868] [2023-01-27 22:09:25,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:09:25,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-01-27 22:09:25,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:09:25,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-01-27 22:09:25,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2023-01-27 22:09:25,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 267 [2023-01-27 22:09:25,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 572 transitions, 7408 flow. Second operand has 26 states, 26 states have (on average 81.65384615384616) internal successors, (2123), 26 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:25,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:09:25,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 267 [2023-01-27 22:09:25,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:09:28,342 INFO L130 PetriNetUnfolder]: 5457/8532 cut-off events. [2023-01-27 22:09:28,342 INFO L131 PetriNetUnfolder]: For 139401/139401 co-relation queries the response was YES. [2023-01-27 22:09:28,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61020 conditions, 8532 events. 5457/8532 cut-off events. For 139401/139401 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 51665 event pairs, 1042 based on Foata normal form. 5/8537 useless extension candidates. Maximal degree in co-relation 60938. Up to 7397 conditions per place. [2023-01-27 22:09:28,419 INFO L137 encePairwiseOnDemand]: 254/267 looper letters, 557 selfloop transitions, 185 changer transitions 17/759 dead transitions. [2023-01-27 22:09:28,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 759 transitions, 10998 flow [2023-01-27 22:09:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-27 22:09:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-01-27 22:09:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2580 transitions. [2023-01-27 22:09:28,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32209737827715357 [2023-01-27 22:09:28,424 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2580 transitions. [2023-01-27 22:09:28,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2580 transitions. [2023-01-27 22:09:28,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:09:28,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2580 transitions. [2023-01-27 22:09:28,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 86.0) internal successors, (2580), 30 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:28,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 267.0) internal successors, (8277), 31 states have internal predecessors, (8277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:28,435 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 267.0) internal successors, (8277), 31 states have internal predecessors, (8277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:28,436 INFO L175 Difference]: Start difference. First operand has 199 places, 572 transitions, 7408 flow. Second operand 30 states and 2580 transitions. [2023-01-27 22:09:28,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 759 transitions, 10998 flow [2023-01-27 22:09:29,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 759 transitions, 10246 flow, removed 338 selfloop flow, removed 6 redundant places. [2023-01-27 22:09:29,314 INFO L231 Difference]: Finished difference. Result has 233 places, 645 transitions, 8388 flow [2023-01-27 22:09:29,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=6885, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=8388, PETRI_PLACES=233, PETRI_TRANSITIONS=645} [2023-01-27 22:09:29,314 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2023-01-27 22:09:29,314 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 645 transitions, 8388 flow [2023-01-27 22:09:29,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 81.65384615384616) internal successors, (2123), 26 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:29,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:09:29,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:09:29,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-27 22:09:29,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:29,521 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:09:29,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:09:29,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1868694365, now seen corresponding path program 7 times [2023-01-27 22:09:29,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:09:29,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942896998] [2023-01-27 22:09:29,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:09:29,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:09:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:09:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:30,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:09:30,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942896998] [2023-01-27 22:09:30,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942896998] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:09:30,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118132490] [2023-01-27 22:09:30,813 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 22:09:30,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:30,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:09:30,814 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:09:30,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-27 22:09:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:09:30,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-27 22:09:30,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:09:31,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:09:31,187 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 34 treesize of output 32 [2023-01-27 22:09:31,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:09:31,258 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 34 treesize of output 32 [2023-01-27 22:09:31,386 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:09:31,388 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:09:31,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 37 [2023-01-27 22:09:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:31,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:09:31,763 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or .cse0 (forall ((v_ArrVal_380 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_380) c_~A~0.base) .cse2))) (or (<= c_~min3~0 .cse1) (< .cse1 c_~min2~0))))) (or (forall ((v_ArrVal_380 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_380) c_~A~0.base) .cse2) c_~min3~0)) (and (or (<= c_~min2~0 c_~min3~0) (= c_~min1~0 c_~min3~0)) (or .cse0 (< c_~min3~0 c_~min2~0)))) (forall ((v_ArrVal_380 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_380) c_~A~0.base) .cse2))) (or (<= c_~min3~0 .cse3) (<= c_~min2~0 .cse3) (= c_~min1~0 .cse3)))))) is different from false [2023-01-27 22:09:31,811 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (and (or (<= c_~min2~0 c_~min3~0) (= c_~min1~0 c_~min3~0)) (or .cse0 (< c_~min3~0 c_~min2~0))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_380) c_~A~0.base) .cse1) c_~min3~0))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_380) c_~A~0.base) .cse1))) (or (<= c_~min2~0 .cse2) (= c_~min1~0 .cse2) (<= c_~min3~0 .cse2)))) (or .cse0 (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_380) c_~A~0.base) .cse1))) (or (< .cse3 c_~min2~0) (<= c_~min3~0 .cse3))))))) is different from false [2023-01-27 22:09:31,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:09:31,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 938 treesize of output 826 [2023-01-27 22:09:31,884 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 376 treesize of output 364 [2023-01-27 22:09:31,890 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 364 treesize of output 340 [2023-01-27 22:09:31,896 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 340 treesize of output 322 [2023-01-27 22:09:31,907 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 322 treesize of output 286 [2023-01-27 22:09:31,915 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 286 treesize of output 280 [2023-01-27 22:09:31,923 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 280 treesize of output 268 [2023-01-27 22:09:32,156 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-27 22:09:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-27 22:09:32,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118132490] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:09:32,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:09:32,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2023-01-27 22:09:32,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299414296] [2023-01-27 22:09:32,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:09:32,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-27 22:09:32,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:09:32,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-27 22:09:32,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=676, Unknown=2, NotChecked=110, Total=930 [2023-01-27 22:09:32,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 267 [2023-01-27 22:09:32,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 645 transitions, 8388 flow. Second operand has 31 states, 31 states have (on average 71.2258064516129) internal successors, (2208), 31 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:32,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:09:32,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 267 [2023-01-27 22:09:32,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:09:35,845 INFO L130 PetriNetUnfolder]: 6791/10601 cut-off events. [2023-01-27 22:09:35,845 INFO L131 PetriNetUnfolder]: For 166112/166112 co-relation queries the response was YES. [2023-01-27 22:09:35,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76019 conditions, 10601 events. 6791/10601 cut-off events. For 166112/166112 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 66582 event pairs, 805 based on Foata normal form. 4/10605 useless extension candidates. Maximal degree in co-relation 75925. Up to 6807 conditions per place. [2023-01-27 22:09:35,937 INFO L137 encePairwiseOnDemand]: 251/267 looper letters, 550 selfloop transitions, 409 changer transitions 8/967 dead transitions. [2023-01-27 22:09:35,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 967 transitions, 14279 flow [2023-01-27 22:09:35,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-27 22:09:35,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-01-27 22:09:35,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1660 transitions. [2023-01-27 22:09:35,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2960584983056893 [2023-01-27 22:09:35,941 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1660 transitions. [2023-01-27 22:09:35,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1660 transitions. [2023-01-27 22:09:35,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:09:35,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1660 transitions. [2023-01-27 22:09:35,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 79.04761904761905) internal successors, (1660), 21 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:35,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 267.0) internal successors, (5874), 22 states have internal predecessors, (5874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:35,951 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 267.0) internal successors, (5874), 22 states have internal predecessors, (5874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:35,951 INFO L175 Difference]: Start difference. First operand has 233 places, 645 transitions, 8388 flow. Second operand 21 states and 1660 transitions. [2023-01-27 22:09:35,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 967 transitions, 14279 flow [2023-01-27 22:09:36,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 967 transitions, 13867 flow, removed 165 selfloop flow, removed 12 redundant places. [2023-01-27 22:09:36,767 INFO L231 Difference]: Finished difference. Result has 252 places, 825 transitions, 12220 flow [2023-01-27 22:09:36,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=7985, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=257, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=12220, PETRI_PLACES=252, PETRI_TRANSITIONS=825} [2023-01-27 22:09:36,768 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2023-01-27 22:09:36,768 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 825 transitions, 12220 flow [2023-01-27 22:09:36,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 71.2258064516129) internal successors, (2208), 31 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:36,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:09:36,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:09:36,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-27 22:09:36,969 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,SelfDestructingSolverStorable8 [2023-01-27 22:09:36,970 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:09:36,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:09:36,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1505548975, now seen corresponding path program 1 times [2023-01-27 22:09:36,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:09:36,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580601847] [2023-01-27 22:09:36,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:09:36,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:09:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:09:37,084 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-27 22:09:37,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:09:37,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580601847] [2023-01-27 22:09:37,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580601847] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:09:37,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475218278] [2023-01-27 22:09:37,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:09:37,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:37,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:09:37,089 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:09:37,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-27 22:09:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:09:37,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-27 22:09:37,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:09:37,300 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-27 22:09:37,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:09:37,391 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-27 22:09:37,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475218278] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:09:37,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:09:37,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-01-27 22:09:37,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774606195] [2023-01-27 22:09:37,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:09:37,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-27 22:09:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:09:37,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-27 22:09:37,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-01-27 22:09:37,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 267 [2023-01-27 22:09:37,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 825 transitions, 12220 flow. Second operand has 18 states, 18 states have (on average 100.27777777777777) internal successors, (1805), 18 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:37,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:09:37,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 267 [2023-01-27 22:09:37,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:09:41,486 INFO L130 PetriNetUnfolder]: 9715/15619 cut-off events. [2023-01-27 22:09:41,486 INFO L131 PetriNetUnfolder]: For 348142/348190 co-relation queries the response was YES. [2023-01-27 22:09:41,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125431 conditions, 15619 events. 9715/15619 cut-off events. For 348142/348190 co-relation queries the response was YES. Maximal size of possible extension queue 902. Compared 112535 event pairs, 695 based on Foata normal form. 367/15967 useless extension candidates. Maximal degree in co-relation 125326. Up to 4868 conditions per place. [2023-01-27 22:09:41,636 INFO L137 encePairwiseOnDemand]: 258/267 looper letters, 1468 selfloop transitions, 411 changer transitions 30/1924 dead transitions. [2023-01-27 22:09:41,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 1924 transitions, 30393 flow [2023-01-27 22:09:41,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-01-27 22:09:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-01-27 22:09:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2149 transitions. [2023-01-27 22:09:41,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40243445692883895 [2023-01-27 22:09:41,639 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2149 transitions. [2023-01-27 22:09:41,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2149 transitions. [2023-01-27 22:09:41,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:09:41,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2149 transitions. [2023-01-27 22:09:41,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 107.45) internal successors, (2149), 20 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:41,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:41,648 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:41,648 INFO L175 Difference]: Start difference. First operand has 252 places, 825 transitions, 12220 flow. Second operand 20 states and 2149 transitions. [2023-01-27 22:09:41,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 1924 transitions, 30393 flow [2023-01-27 22:09:43,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 1924 transitions, 29407 flow, removed 403 selfloop flow, removed 8 redundant places. [2023-01-27 22:09:43,811 INFO L231 Difference]: Finished difference. Result has 275 places, 1064 transitions, 17268 flow [2023-01-27 22:09:43,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=11572, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=825, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=17268, PETRI_PLACES=275, PETRI_TRANSITIONS=1064} [2023-01-27 22:09:43,812 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 245 predicate places. [2023-01-27 22:09:43,812 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 1064 transitions, 17268 flow [2023-01-27 22:09:43,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 100.27777777777777) internal successors, (1805), 18 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:43,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:09:43,813 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:09:43,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-27 22:09:44,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-01-27 22:09:44,014 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:09:44,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:09:44,014 INFO L85 PathProgramCache]: Analyzing trace with hash 17771202, now seen corresponding path program 8 times [2023-01-27 22:09:44,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:09:44,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095799296] [2023-01-27 22:09:44,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:09:44,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:09:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:09:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:44,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:09:44,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095799296] [2023-01-27 22:09:44,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095799296] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:09:44,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091214356] [2023-01-27 22:09:44,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:09:44,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:44,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:09:44,109 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:09:44,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-27 22:09:44,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:09:44,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:09:44,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 22:09:44,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:09:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:44,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:09:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:09:44,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091214356] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:09:44,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:09:44,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-01-27 22:09:44,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86032353] [2023-01-27 22:09:44,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:09:44,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-27 22:09:44,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:09:44,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-27 22:09:44,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-01-27 22:09:44,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 267 [2023-01-27 22:09:44,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 1064 transitions, 17268 flow. Second operand has 15 states, 15 states have (on average 107.8) internal successors, (1617), 15 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:44,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:09:44,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 267 [2023-01-27 22:09:44,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:09:47,906 INFO L130 PetriNetUnfolder]: 7736/12414 cut-off events. [2023-01-27 22:09:47,907 INFO L131 PetriNetUnfolder]: For 347597/349075 co-relation queries the response was YES. [2023-01-27 22:09:47,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107449 conditions, 12414 events. 7736/12414 cut-off events. For 347597/349075 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 86997 event pairs, 2257 based on Foata normal form. 929/13019 useless extension candidates. Maximal degree in co-relation 107332. Up to 9471 conditions per place. [2023-01-27 22:09:48,047 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 859 selfloop transitions, 82 changer transitions 2/1065 dead transitions. [2023-01-27 22:09:48,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 1065 transitions, 19008 flow [2023-01-27 22:09:48,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 22:09:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 22:09:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 800 transitions. [2023-01-27 22:09:48,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803638309256287 [2023-01-27 22:09:48,049 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 800 transitions. [2023-01-27 22:09:48,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 800 transitions. [2023-01-27 22:09:48,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:09:48,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 800 transitions. [2023-01-27 22:09:48,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:48,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:48,053 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:48,053 INFO L175 Difference]: Start difference. First operand has 275 places, 1064 transitions, 17268 flow. Second operand 7 states and 800 transitions. [2023-01-27 22:09:48,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 1065 transitions, 19008 flow [2023-01-27 22:09:51,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 1065 transitions, 17887 flow, removed 553 selfloop flow, removed 6 redundant places. [2023-01-27 22:09:51,772 INFO L231 Difference]: Finished difference. Result has 278 places, 982 transitions, 15302 flow [2023-01-27 22:09:51,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=14833, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=891, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=15302, PETRI_PLACES=278, PETRI_TRANSITIONS=982} [2023-01-27 22:09:51,774 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 248 predicate places. [2023-01-27 22:09:51,774 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 982 transitions, 15302 flow [2023-01-27 22:09:51,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 107.8) internal successors, (1617), 15 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:51,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:09:51,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:09:51,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-27 22:09:51,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-01-27 22:09:51,981 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:09:51,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:09:51,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1595059175, now seen corresponding path program 2 times [2023-01-27 22:09:51,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:09:51,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228723637] [2023-01-27 22:09:51,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:09:51,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:09:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:09:52,095 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-27 22:09:52,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:09:52,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228723637] [2023-01-27 22:09:52,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228723637] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:09:52,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725342866] [2023-01-27 22:09:52,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:09:52,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:52,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:09:52,097 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:09:52,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-27 22:09:52,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:09:52,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:09:52,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-27 22:09:52,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:09:52,312 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-27 22:09:52,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:09:52,374 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-27 22:09:52,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725342866] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:09:52,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:09:52,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2023-01-27 22:09:52,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021007476] [2023-01-27 22:09:52,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:09:52,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-27 22:09:52,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:09:52,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-27 22:09:52,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-01-27 22:09:52,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 267 [2023-01-27 22:09:52,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 982 transitions, 15302 flow. Second operand has 15 states, 15 states have (on average 101.66666666666667) internal successors, (1525), 15 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:52,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:09:52,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 267 [2023-01-27 22:09:52,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:09:55,340 INFO L130 PetriNetUnfolder]: 6651/11107 cut-off events. [2023-01-27 22:09:55,340 INFO L131 PetriNetUnfolder]: For 172562/172622 co-relation queries the response was YES. [2023-01-27 22:09:55,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79680 conditions, 11107 events. 6651/11107 cut-off events. For 172562/172622 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 79726 event pairs, 722 based on Foata normal form. 841/11934 useless extension candidates. Maximal degree in co-relation 79563. Up to 6589 conditions per place. [2023-01-27 22:09:55,425 INFO L137 encePairwiseOnDemand]: 260/267 looper letters, 843 selfloop transitions, 104 changer transitions 27/990 dead transitions. [2023-01-27 22:09:55,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 990 transitions, 15933 flow [2023-01-27 22:09:55,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 22:09:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 22:09:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 963 transitions. [2023-01-27 22:09:55,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40074906367041196 [2023-01-27 22:09:55,427 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 963 transitions. [2023-01-27 22:09:55,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 963 transitions. [2023-01-27 22:09:55,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:09:55,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 963 transitions. [2023-01-27 22:09:55,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.0) internal successors, (963), 9 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:55,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:55,431 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:55,431 INFO L175 Difference]: Start difference. First operand has 278 places, 982 transitions, 15302 flow. Second operand 9 states and 963 transitions. [2023-01-27 22:09:55,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 990 transitions, 15933 flow [2023-01-27 22:09:56,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 990 transitions, 15750 flow, removed 89 selfloop flow, removed 8 redundant places. [2023-01-27 22:09:56,395 INFO L231 Difference]: Finished difference. Result has 272 places, 716 transitions, 10987 flow [2023-01-27 22:09:56,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=10933, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10987, PETRI_PLACES=272, PETRI_TRANSITIONS=716} [2023-01-27 22:09:56,396 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 242 predicate places. [2023-01-27 22:09:56,396 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 716 transitions, 10987 flow [2023-01-27 22:09:56,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 101.66666666666667) internal successors, (1525), 15 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:56,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:09:56,397 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:09:56,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-27 22:09:56,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-01-27 22:09:56,602 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:09:56,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:09:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2030722030, now seen corresponding path program 9 times [2023-01-27 22:09:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:09:56,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350959124] [2023-01-27 22:09:56,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:09:56,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:09:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:09:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:09:56,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:09:56,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350959124] [2023-01-27 22:09:56,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350959124] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:09:56,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475697250] [2023-01-27 22:09:56,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:09:56,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:56,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:09:56,685 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:09:56,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-27 22:09:56,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 22:09:56,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:09:56,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 22:09:56,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:09:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:09:56,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:09:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:09:56,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475697250] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:09:56,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:09:56,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-01-27 22:09:56,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916790256] [2023-01-27 22:09:56,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:09:56,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-27 22:09:56,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:09:56,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-27 22:09:56,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-01-27 22:09:56,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 267 [2023-01-27 22:09:56,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 716 transitions, 10987 flow. Second operand has 14 states, 14 states have (on average 107.35714285714286) internal successors, (1503), 14 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:56,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:09:56,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 267 [2023-01-27 22:09:56,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:09:58,569 INFO L130 PetriNetUnfolder]: 4406/7527 cut-off events. [2023-01-27 22:09:58,569 INFO L131 PetriNetUnfolder]: For 133467/134439 co-relation queries the response was YES. [2023-01-27 22:09:58,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55217 conditions, 7527 events. 4406/7527 cut-off events. For 133467/134439 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 53496 event pairs, 1043 based on Foata normal form. 958/8250 useless extension candidates. Maximal degree in co-relation 55105. Up to 4307 conditions per place. [2023-01-27 22:09:58,624 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 485 selfloop transitions, 27 changer transitions 32/641 dead transitions. [2023-01-27 22:09:58,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 641 transitions, 11079 flow [2023-01-27 22:09:58,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 22:09:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 22:09:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 909 transitions. [2023-01-27 22:09:58,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425561797752809 [2023-01-27 22:09:58,626 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 909 transitions. [2023-01-27 22:09:58,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 909 transitions. [2023-01-27 22:09:58,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:09:58,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 909 transitions. [2023-01-27 22:09:58,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.625) internal successors, (909), 8 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:58,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:58,629 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:58,630 INFO L175 Difference]: Start difference. First operand has 272 places, 716 transitions, 10987 flow. Second operand 8 states and 909 transitions. [2023-01-27 22:09:58,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 641 transitions, 11079 flow [2023-01-27 22:09:59,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 641 transitions, 10652 flow, removed 133 selfloop flow, removed 19 redundant places. [2023-01-27 22:09:59,449 INFO L231 Difference]: Finished difference. Result has 245 places, 543 transitions, 8477 flow [2023-01-27 22:09:59,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=8609, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8477, PETRI_PLACES=245, PETRI_TRANSITIONS=543} [2023-01-27 22:09:59,450 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2023-01-27 22:09:59,450 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 543 transitions, 8477 flow [2023-01-27 22:09:59,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 107.35714285714286) internal successors, (1503), 14 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:09:59,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:09:59,451 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:09:59,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-27 22:09:59,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-01-27 22:09:59,652 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:09:59,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:09:59,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1080724745, now seen corresponding path program 10 times [2023-01-27 22:09:59,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:09:59,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862555563] [2023-01-27 22:09:59,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:09:59,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:09:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:09:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:09:59,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:09:59,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862555563] [2023-01-27 22:09:59,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862555563] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:09:59,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920132581] [2023-01-27 22:09:59,766 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:09:59,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:09:59,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:09:59,769 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:09:59,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-27 22:09:59,858 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:09:59,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:09:59,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2023-01-27 22:09:59,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:09:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:09:59,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:10:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:10:00,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920132581] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:10:00,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:10:00,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2023-01-27 22:10:00,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693031869] [2023-01-27 22:10:00,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:10:00,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-01-27 22:10:00,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:10:00,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-01-27 22:10:00,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-01-27 22:10:00,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 267 [2023-01-27 22:10:00,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 543 transitions, 8477 flow. Second operand has 16 states, 16 states have (on average 101.0) internal successors, (1616), 16 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:00,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:10:00,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 267 [2023-01-27 22:10:00,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:10:01,470 INFO L130 PetriNetUnfolder]: 3345/5757 cut-off events. [2023-01-27 22:10:01,470 INFO L131 PetriNetUnfolder]: For 89363/89744 co-relation queries the response was YES. [2023-01-27 22:10:01,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42147 conditions, 5757 events. 3345/5757 cut-off events. For 89363/89744 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 39204 event pairs, 488 based on Foata normal form. 510/6199 useless extension candidates. Maximal degree in co-relation 42048. Up to 2104 conditions per place. [2023-01-27 22:10:01,508 INFO L137 encePairwiseOnDemand]: 259/267 looper letters, 261 selfloop transitions, 120 changer transitions 262/655 dead transitions. [2023-01-27 22:10:01,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 655 transitions, 10966 flow [2023-01-27 22:10:01,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-01-27 22:10:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-01-27 22:10:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1993 transitions. [2023-01-27 22:10:01,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3928641829292332 [2023-01-27 22:10:01,510 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1993 transitions. [2023-01-27 22:10:01,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1993 transitions. [2023-01-27 22:10:01,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:10:01,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1993 transitions. [2023-01-27 22:10:01,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 104.89473684210526) internal successors, (1993), 19 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:01,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 267.0) internal successors, (5340), 20 states have internal predecessors, (5340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:01,515 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 267.0) internal successors, (5340), 20 states have internal predecessors, (5340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:01,515 INFO L175 Difference]: Start difference. First operand has 245 places, 543 transitions, 8477 flow. Second operand 19 states and 1993 transitions. [2023-01-27 22:10:01,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 655 transitions, 10966 flow [2023-01-27 22:10:01,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 655 transitions, 10592 flow, removed 66 selfloop flow, removed 14 redundant places. [2023-01-27 22:10:01,872 INFO L231 Difference]: Finished difference. Result has 244 places, 333 transitions, 4458 flow [2023-01-27 22:10:01,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=7888, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4458, PETRI_PLACES=244, PETRI_TRANSITIONS=333} [2023-01-27 22:10:01,873 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2023-01-27 22:10:01,873 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 333 transitions, 4458 flow [2023-01-27 22:10:01,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 101.0) internal successors, (1616), 16 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:01,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:10:01,873 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:10:01,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-01-27 22:10:02,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-27 22:10:02,157 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:10:02,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:10:02,157 INFO L85 PathProgramCache]: Analyzing trace with hash -862209951, now seen corresponding path program 11 times [2023-01-27 22:10:02,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:10:02,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515266872] [2023-01-27 22:10:02,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:10:02,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:10:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:10:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:10:02,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:10:02,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515266872] [2023-01-27 22:10:02,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515266872] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:10:02,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017695962] [2023-01-27 22:10:02,293 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 22:10:02,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:10:02,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:10:02,295 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:10:02,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-27 22:10:02,381 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:10:02,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:10:02,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 22:10:02,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:10:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:02,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:10:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:02,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017695962] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:10:02,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:10:02,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-01-27 22:10:02,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81184931] [2023-01-27 22:10:02,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:10:02,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-01-27 22:10:02,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:10:02,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-01-27 22:10:02,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-01-27 22:10:02,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 267 [2023-01-27 22:10:02,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 333 transitions, 4458 flow. Second operand has 19 states, 19 states have (on average 97.52631578947368) internal successors, (1853), 19 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:02,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:10:02,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 267 [2023-01-27 22:10:02,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:10:04,595 INFO L130 PetriNetUnfolder]: 3075/4688 cut-off events. [2023-01-27 22:10:04,595 INFO L131 PetriNetUnfolder]: For 75281/75281 co-relation queries the response was YES. [2023-01-27 22:10:04,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38573 conditions, 4688 events. 3075/4688 cut-off events. For 75281/75281 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 24206 event pairs, 160 based on Foata normal form. 28/4716 useless extension candidates. Maximal degree in co-relation 38496. Up to 1638 conditions per place. [2023-01-27 22:10:04,626 INFO L137 encePairwiseOnDemand]: 257/267 looper letters, 423 selfloop transitions, 383 changer transitions 0/806 dead transitions. [2023-01-27 22:10:04,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 806 transitions, 12365 flow [2023-01-27 22:10:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-01-27 22:10:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-01-27 22:10:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 4674 transitions. [2023-01-27 22:10:04,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3805569125549585 [2023-01-27 22:10:04,632 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 4674 transitions. [2023-01-27 22:10:04,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 4674 transitions. [2023-01-27 22:10:04,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:10:04,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 4674 transitions. [2023-01-27 22:10:04,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 101.6086956521739) internal successors, (4674), 46 states have internal predecessors, (4674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:04,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 267.0) internal successors, (12549), 47 states have internal predecessors, (12549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:04,645 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 267.0) internal successors, (12549), 47 states have internal predecessors, (12549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:04,646 INFO L175 Difference]: Start difference. First operand has 244 places, 333 transitions, 4458 flow. Second operand 46 states and 4674 transitions. [2023-01-27 22:10:04,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 806 transitions, 12365 flow [2023-01-27 22:10:04,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 806 transitions, 10765 flow, removed 579 selfloop flow, removed 23 redundant places. [2023-01-27 22:10:04,846 INFO L231 Difference]: Finished difference. Result has 225 places, 547 transitions, 8129 flow [2023-01-27 22:10:04,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=3828, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=8129, PETRI_PLACES=225, PETRI_TRANSITIONS=547} [2023-01-27 22:10:04,846 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 195 predicate places. [2023-01-27 22:10:04,846 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 547 transitions, 8129 flow [2023-01-27 22:10:04,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 97.52631578947368) internal successors, (1853), 19 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:04,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:10:04,847 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:10:04,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-01-27 22:10:05,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:10:05,047 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:10:05,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:10:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 41038503, now seen corresponding path program 12 times [2023-01-27 22:10:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:10:05,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291119746] [2023-01-27 22:10:05,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:10:05,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:10:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:10:05,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:05,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:10:05,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291119746] [2023-01-27 22:10:05,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291119746] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:10:05,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43373339] [2023-01-27 22:10:05,163 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 22:10:05,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:10:05,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:10:05,165 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:10:05,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-27 22:10:05,281 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-27 22:10:05,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:10:05,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-27 22:10:05,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:10:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:05,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:10:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:05,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43373339] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:10:05,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:10:05,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2023-01-27 22:10:05,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630883524] [2023-01-27 22:10:05,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:10:05,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-01-27 22:10:05,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:10:05,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-01-27 22:10:05,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-01-27 22:10:05,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 267 [2023-01-27 22:10:05,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 547 transitions, 8129 flow. Second operand has 19 states, 19 states have (on average 100.15789473684211) internal successors, (1903), 19 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:05,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:10:05,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 267 [2023-01-27 22:10:05,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:10:06,472 INFO L130 PetriNetUnfolder]: 3028/4625 cut-off events. [2023-01-27 22:10:06,473 INFO L131 PetriNetUnfolder]: For 94559/94581 co-relation queries the response was YES. [2023-01-27 22:10:06,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40144 conditions, 4625 events. 3028/4625 cut-off events. For 94559/94581 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 24151 event pairs, 451 based on Foata normal form. 70/4685 useless extension candidates. Maximal degree in co-relation 40065. Up to 2265 conditions per place. [2023-01-27 22:10:06,510 INFO L137 encePairwiseOnDemand]: 259/267 looper letters, 499 selfloop transitions, 155 changer transitions 0/681 dead transitions. [2023-01-27 22:10:06,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 681 transitions, 11461 flow [2023-01-27 22:10:06,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 22:10:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 22:10:06,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 950 transitions. [2023-01-27 22:10:06,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3953391593841032 [2023-01-27 22:10:06,512 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 950 transitions. [2023-01-27 22:10:06,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 950 transitions. [2023-01-27 22:10:06,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:10:06,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 950 transitions. [2023-01-27 22:10:06,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.55555555555556) internal successors, (950), 9 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:06,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:06,515 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:06,515 INFO L175 Difference]: Start difference. First operand has 225 places, 547 transitions, 8129 flow. Second operand 9 states and 950 transitions. [2023-01-27 22:10:06,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 681 transitions, 11461 flow [2023-01-27 22:10:06,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 681 transitions, 10339 flow, removed 552 selfloop flow, removed 7 redundant places. [2023-01-27 22:10:06,830 INFO L231 Difference]: Finished difference. Result has 222 places, 536 transitions, 7825 flow [2023-01-27 22:10:06,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=6933, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7825, PETRI_PLACES=222, PETRI_TRANSITIONS=536} [2023-01-27 22:10:06,830 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 192 predicate places. [2023-01-27 22:10:06,830 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 536 transitions, 7825 flow [2023-01-27 22:10:06,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 100.15789473684211) internal successors, (1903), 19 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:06,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:10:06,831 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:10:06,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-01-27 22:10:07,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-27 22:10:07,037 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:10:07,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:10:07,037 INFO L85 PathProgramCache]: Analyzing trace with hash 594494739, now seen corresponding path program 13 times [2023-01-27 22:10:07,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:10:07,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780330649] [2023-01-27 22:10:07,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:10:07,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:10:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:10:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:07,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:10:07,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780330649] [2023-01-27 22:10:07,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780330649] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:10:07,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419701498] [2023-01-27 22:10:07,166 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 22:10:07,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:10:07,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:10:07,169 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:10:07,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-01-27 22:10:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:10:07,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-27 22:10:07,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:10:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:07,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:10:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:07,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419701498] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:10:07,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:10:07,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-01-27 22:10:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043004544] [2023-01-27 22:10:07,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:10:07,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-27 22:10:07,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:10:07,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-27 22:10:07,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-01-27 22:10:07,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 267 [2023-01-27 22:10:07,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 536 transitions, 7825 flow. Second operand has 21 states, 21 states have (on average 99.85714285714286) internal successors, (2097), 21 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:07,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:10:07,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 267 [2023-01-27 22:10:07,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:10:08,659 INFO L130 PetriNetUnfolder]: 3159/4854 cut-off events. [2023-01-27 22:10:08,659 INFO L131 PetriNetUnfolder]: For 101629/101667 co-relation queries the response was YES. [2023-01-27 22:10:08,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41653 conditions, 4854 events. 3159/4854 cut-off events. For 101629/101667 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 25958 event pairs, 442 based on Foata normal form. 46/4890 useless extension candidates. Maximal degree in co-relation 41574. Up to 2278 conditions per place. [2023-01-27 22:10:08,701 INFO L137 encePairwiseOnDemand]: 259/267 looper letters, 487 selfloop transitions, 235 changer transitions 0/749 dead transitions. [2023-01-27 22:10:08,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 749 transitions, 11854 flow [2023-01-27 22:10:08,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-27 22:10:08,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-27 22:10:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1487 transitions. [2023-01-27 22:10:08,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39780631353665064 [2023-01-27 22:10:08,703 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1487 transitions. [2023-01-27 22:10:08,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1487 transitions. [2023-01-27 22:10:08,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:10:08,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1487 transitions. [2023-01-27 22:10:08,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 106.21428571428571) internal successors, (1487), 14 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:08,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 267.0) internal successors, (4005), 15 states have internal predecessors, (4005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:08,708 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 267.0) internal successors, (4005), 15 states have internal predecessors, (4005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:08,708 INFO L175 Difference]: Start difference. First operand has 222 places, 536 transitions, 7825 flow. Second operand 14 states and 1487 transitions. [2023-01-27 22:10:08,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 749 transitions, 11854 flow [2023-01-27 22:10:09,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 749 transitions, 11550 flow, removed 79 selfloop flow, removed 6 redundant places. [2023-01-27 22:10:09,094 INFO L231 Difference]: Finished difference. Result has 234 places, 603 transitions, 9455 flow [2023-01-27 22:10:09,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=7590, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=9455, PETRI_PLACES=234, PETRI_TRANSITIONS=603} [2023-01-27 22:10:09,095 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places. [2023-01-27 22:10:09,095 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 603 transitions, 9455 flow [2023-01-27 22:10:09,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 99.85714285714286) internal successors, (2097), 21 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:09,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:10:09,095 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:10:09,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-01-27 22:10:09,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-27 22:10:09,301 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:10:09,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:10:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1361094559, now seen corresponding path program 14 times [2023-01-27 22:10:09,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:10:09,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233731763] [2023-01-27 22:10:09,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:10:09,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:10:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:10:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:09,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:10:09,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233731763] [2023-01-27 22:10:09,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233731763] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:10:09,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387785643] [2023-01-27 22:10:09,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:10:09,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:10:09,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:10:09,417 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:10:09,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-01-27 22:10:09,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:10:09,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:10:09,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-27 22:10:09,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:10:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:09,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:10:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387785643] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:10:09,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:10:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-01-27 22:10:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670241751] [2023-01-27 22:10:09,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:10:09,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-27 22:10:09,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:10:09,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-27 22:10:09,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-01-27 22:10:09,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 267 [2023-01-27 22:10:09,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 603 transitions, 9455 flow. Second operand has 20 states, 20 states have (on average 100.0) internal successors, (2000), 20 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:09,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:10:09,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 267 [2023-01-27 22:10:09,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:10:10,658 INFO L130 PetriNetUnfolder]: 3121/4777 cut-off events. [2023-01-27 22:10:10,658 INFO L131 PetriNetUnfolder]: For 88310/88351 co-relation queries the response was YES. [2023-01-27 22:10:10,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41107 conditions, 4777 events. 3121/4777 cut-off events. For 88310/88351 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 25257 event pairs, 497 based on Foata normal form. 50/4814 useless extension candidates. Maximal degree in co-relation 41025. Up to 2397 conditions per place. [2023-01-27 22:10:10,700 INFO L137 encePairwiseOnDemand]: 259/267 looper letters, 484 selfloop transitions, 168 changer transitions 0/679 dead transitions. [2023-01-27 22:10:10,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 679 transitions, 11554 flow [2023-01-27 22:10:10,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 22:10:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 22:10:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 950 transitions. [2023-01-27 22:10:10,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3953391593841032 [2023-01-27 22:10:10,702 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 950 transitions. [2023-01-27 22:10:10,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 950 transitions. [2023-01-27 22:10:10,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:10:10,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 950 transitions. [2023-01-27 22:10:10,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.55555555555556) internal successors, (950), 9 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:10,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:10,705 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:10,705 INFO L175 Difference]: Start difference. First operand has 234 places, 603 transitions, 9455 flow. Second operand 9 states and 950 transitions. [2023-01-27 22:10:10,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 679 transitions, 11554 flow [2023-01-27 22:10:11,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 679 transitions, 11142 flow, removed 133 selfloop flow, removed 6 redundant places. [2023-01-27 22:10:11,093 INFO L231 Difference]: Finished difference. Result has 234 places, 598 transitions, 9335 flow [2023-01-27 22:10:11,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=8840, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9335, PETRI_PLACES=234, PETRI_TRANSITIONS=598} [2023-01-27 22:10:11,094 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places. [2023-01-27 22:10:11,094 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 598 transitions, 9335 flow [2023-01-27 22:10:11,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 100.0) internal successors, (2000), 20 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:11,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:10:11,094 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:10:11,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-01-27 22:10:11,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-27 22:10:11,300 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:10:11,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:10:11,300 INFO L85 PathProgramCache]: Analyzing trace with hash 649905999, now seen corresponding path program 15 times [2023-01-27 22:10:11,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:10:11,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055868833] [2023-01-27 22:10:11,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:10:11,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:10:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:10:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:11,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:10:11,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055868833] [2023-01-27 22:10:11,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055868833] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:10:11,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244546545] [2023-01-27 22:10:11,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:10:11,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:10:11,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:10:11,432 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:10:11,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-01-27 22:10:11,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 22:10:11,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:10:11,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-27 22:10:11,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:10:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:11,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:10:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:11,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244546545] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:10:11,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:10:11,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-01-27 22:10:11,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260291024] [2023-01-27 22:10:11,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:10:11,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-27 22:10:11,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:10:11,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-27 22:10:11,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-01-27 22:10:11,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 267 [2023-01-27 22:10:11,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 598 transitions, 9335 flow. Second operand has 22 states, 22 states have (on average 99.81818181818181) internal successors, (2196), 22 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:11,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:10:11,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 267 [2023-01-27 22:10:11,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:10:12,696 INFO L130 PetriNetUnfolder]: 3092/4717 cut-off events. [2023-01-27 22:10:12,696 INFO L131 PetriNetUnfolder]: For 79921/79959 co-relation queries the response was YES. [2023-01-27 22:10:12,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40217 conditions, 4717 events. 3092/4717 cut-off events. For 79921/79959 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 24762 event pairs, 467 based on Foata normal form. 42/4746 useless extension candidates. Maximal degree in co-relation 40136. Up to 2279 conditions per place. [2023-01-27 22:10:12,737 INFO L137 encePairwiseOnDemand]: 259/267 looper letters, 435 selfloop transitions, 226 changer transitions 0/688 dead transitions. [2023-01-27 22:10:12,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 688 transitions, 11590 flow [2023-01-27 22:10:12,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 22:10:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 22:10:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1059 transitions. [2023-01-27 22:10:12,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39662921348314606 [2023-01-27 22:10:12,739 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1059 transitions. [2023-01-27 22:10:12,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1059 transitions. [2023-01-27 22:10:12,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:10:12,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1059 transitions. [2023-01-27 22:10:12,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.9) internal successors, (1059), 10 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:12,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 267.0) internal successors, (2937), 11 states have internal predecessors, (2937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:12,742 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 267.0) internal successors, (2937), 11 states have internal predecessors, (2937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:12,742 INFO L175 Difference]: Start difference. First operand has 234 places, 598 transitions, 9335 flow. Second operand 10 states and 1059 transitions. [2023-01-27 22:10:12,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 688 transitions, 11590 flow [2023-01-27 22:10:13,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 688 transitions, 11400 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-01-27 22:10:13,105 INFO L231 Difference]: Finished difference. Result has 236 places, 597 transitions, 9583 flow [2023-01-27 22:10:13,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=9131, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9583, PETRI_PLACES=236, PETRI_TRANSITIONS=597} [2023-01-27 22:10:13,106 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 206 predicate places. [2023-01-27 22:10:13,106 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 597 transitions, 9583 flow [2023-01-27 22:10:13,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 99.81818181818181) internal successors, (2196), 22 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:13,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:10:13,106 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:10:13,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-01-27 22:10:13,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:10:13,312 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:10:13,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:10:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1481117643, now seen corresponding path program 16 times [2023-01-27 22:10:13,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:10:13,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299983718] [2023-01-27 22:10:13,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:10:13,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:10:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:10:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:10:13,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:10:13,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299983718] [2023-01-27 22:10:13,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299983718] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:10:13,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166139998] [2023-01-27 22:10:13,435 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:10:13,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:10:13,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:10:13,436 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:10:13,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-01-27 22:10:13,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:10:13,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:10:13,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 22:10:13,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:10:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:13,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:10:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:13,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166139998] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:10:13,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:10:13,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2023-01-27 22:10:13,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111095676] [2023-01-27 22:10:13,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:10:13,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-27 22:10:13,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:10:13,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-27 22:10:13,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2023-01-27 22:10:13,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 267 [2023-01-27 22:10:13,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 597 transitions, 9583 flow. Second operand has 20 states, 20 states have (on average 97.35) internal successors, (1947), 20 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:13,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:10:13,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 267 [2023-01-27 22:10:13,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:10:15,522 INFO L130 PetriNetUnfolder]: 3115/4754 cut-off events. [2023-01-27 22:10:15,522 INFO L131 PetriNetUnfolder]: For 84647/84647 co-relation queries the response was YES. [2023-01-27 22:10:15,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40989 conditions, 4754 events. 3115/4754 cut-off events. For 84647/84647 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 24750 event pairs, 180 based on Foata normal form. 26/4780 useless extension candidates. Maximal degree in co-relation 40908. Up to 1696 conditions per place. [2023-01-27 22:10:15,565 INFO L137 encePairwiseOnDemand]: 257/267 looper letters, 407 selfloop transitions, 416 changer transitions 0/823 dead transitions. [2023-01-27 22:10:15,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 823 transitions, 13916 flow [2023-01-27 22:10:15,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-01-27 22:10:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-01-27 22:10:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3784 transitions. [2023-01-27 22:10:15,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3830347201133718 [2023-01-27 22:10:15,569 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3784 transitions. [2023-01-27 22:10:15,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3784 transitions. [2023-01-27 22:10:15,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:10:15,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3784 transitions. [2023-01-27 22:10:15,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 102.27027027027027) internal successors, (3784), 37 states have internal predecessors, (3784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:15,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 267.0) internal successors, (10146), 38 states have internal predecessors, (10146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:15,581 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 267.0) internal successors, (10146), 38 states have internal predecessors, (10146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:15,581 INFO L175 Difference]: Start difference. First operand has 236 places, 597 transitions, 9583 flow. Second operand 37 states and 3784 transitions. [2023-01-27 22:10:15,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 823 transitions, 13916 flow [2023-01-27 22:10:15,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 823 transitions, 13428 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-01-27 22:10:15,961 INFO L231 Difference]: Finished difference. Result has 263 places, 604 transitions, 10076 flow [2023-01-27 22:10:15,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=9072, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=405, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=10076, PETRI_PLACES=263, PETRI_TRANSITIONS=604} [2023-01-27 22:10:15,962 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 233 predicate places. [2023-01-27 22:10:15,962 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 604 transitions, 10076 flow [2023-01-27 22:10:15,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 97.35) internal successors, (1947), 20 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:15,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:10:15,963 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:10:15,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-01-27 22:10:16,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:10:16,168 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:10:16,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:10:16,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1869960955, now seen corresponding path program 17 times [2023-01-27 22:10:16,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:10:16,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554513348] [2023-01-27 22:10:16,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:10:16,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:10:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:10:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:16,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:10:16,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554513348] [2023-01-27 22:10:16,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554513348] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:10:16,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272492251] [2023-01-27 22:10:16,278 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 22:10:16,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:10:16,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:10:16,279 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:10:16,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-01-27 22:10:16,370 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:10:16,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:10:16,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 22:10:16,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:10:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:16,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:10:16,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:10:16,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272492251] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:10:16,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:10:16,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-01-27 22:10:16,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143202312] [2023-01-27 22:10:16,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:10:16,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-27 22:10:16,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:10:16,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-27 22:10:16,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-01-27 22:10:16,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 267 [2023-01-27 22:10:16,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 604 transitions, 10076 flow. Second operand has 18 states, 18 states have (on average 97.55555555555556) internal successors, (1756), 18 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:16,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:10:16,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 267 [2023-01-27 22:10:16,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:10:17,810 INFO L130 PetriNetUnfolder]: 3081/4688 cut-off events. [2023-01-27 22:10:17,810 INFO L131 PetriNetUnfolder]: For 85460/85460 co-relation queries the response was YES. [2023-01-27 22:10:17,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41389 conditions, 4688 events. 3081/4688 cut-off events. For 85460/85460 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 24282 event pairs, 315 based on Foata normal form. 26/4714 useless extension candidates. Maximal degree in co-relation 41308. Up to 2764 conditions per place. [2023-01-27 22:10:17,851 INFO L137 encePairwiseOnDemand]: 257/267 looper letters, 438 selfloop transitions, 274 changer transitions 0/712 dead transitions. [2023-01-27 22:10:17,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 712 transitions, 12831 flow [2023-01-27 22:10:17,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-01-27 22:10:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-01-27 22:10:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1926 transitions. [2023-01-27 22:10:17,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37965700768775873 [2023-01-27 22:10:17,854 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1926 transitions. [2023-01-27 22:10:17,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1926 transitions. [2023-01-27 22:10:17,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:10:17,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1926 transitions. [2023-01-27 22:10:17,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 101.36842105263158) internal successors, (1926), 19 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:17,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 267.0) internal successors, (5340), 20 states have internal predecessors, (5340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:17,860 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 267.0) internal successors, (5340), 20 states have internal predecessors, (5340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:17,860 INFO L175 Difference]: Start difference. First operand has 263 places, 604 transitions, 10076 flow. Second operand 19 states and 1926 transitions. [2023-01-27 22:10:17,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 712 transitions, 12831 flow [2023-01-27 22:10:18,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 712 transitions, 12072 flow, removed 27 selfloop flow, removed 28 redundant places. [2023-01-27 22:10:18,248 INFO L231 Difference]: Finished difference. Result has 256 places, 607 transitions, 9989 flow [2023-01-27 22:10:18,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=9298, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=264, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=9989, PETRI_PLACES=256, PETRI_TRANSITIONS=607} [2023-01-27 22:10:18,249 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 226 predicate places. [2023-01-27 22:10:18,249 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 607 transitions, 9989 flow [2023-01-27 22:10:18,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 97.55555555555556) internal successors, (1756), 18 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:18,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:10:18,249 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:10:18,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-01-27 22:10:18,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-01-27 22:10:18,450 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:10:18,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:10:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash 166044145, now seen corresponding path program 18 times [2023-01-27 22:10:18,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:10:18,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418819408] [2023-01-27 22:10:18,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:10:18,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:10:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:10:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:10:18,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:10:18,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418819408] [2023-01-27 22:10:18,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418819408] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:10:18,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256563711] [2023-01-27 22:10:18,563 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 22:10:18,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:10:18,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:10:18,564 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:10:18,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-01-27 22:10:18,668 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-27 22:10:18,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:10:18,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-27 22:10:18,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:10:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:10:18,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:10:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:10:18,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256563711] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:10:18,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:10:18,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-01-27 22:10:18,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779282447] [2023-01-27 22:10:18,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:10:18,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-27 22:10:18,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:10:18,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-27 22:10:18,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-01-27 22:10:18,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 267 [2023-01-27 22:10:18,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 607 transitions, 9989 flow. Second operand has 20 states, 20 states have (on average 100.1) internal successors, (2002), 20 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:18,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:10:18,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 267 [2023-01-27 22:10:18,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:10:19,938 INFO L130 PetriNetUnfolder]: 3000/4557 cut-off events. [2023-01-27 22:10:19,938 INFO L131 PetriNetUnfolder]: For 78722/78771 co-relation queries the response was YES. [2023-01-27 22:10:19,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39100 conditions, 4557 events. 3000/4557 cut-off events. For 78722/78771 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 23584 event pairs, 402 based on Foata normal form. 55/4605 useless extension candidates. Maximal degree in co-relation 39016. Up to 1849 conditions per place. [2023-01-27 22:10:19,983 INFO L137 encePairwiseOnDemand]: 259/267 looper letters, 349 selfloop transitions, 285 changer transitions 0/662 dead transitions. [2023-01-27 22:10:19,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 662 transitions, 11787 flow [2023-01-27 22:10:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 22:10:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 22:10:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 949 transitions. [2023-01-27 22:10:19,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.394923012900541 [2023-01-27 22:10:19,985 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 949 transitions. [2023-01-27 22:10:19,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 949 transitions. [2023-01-27 22:10:19,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:10:19,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 949 transitions. [2023-01-27 22:10:19,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.44444444444444) internal successors, (949), 9 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:19,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:19,988 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:19,988 INFO L175 Difference]: Start difference. First operand has 256 places, 607 transitions, 9989 flow. Second operand 9 states and 949 transitions. [2023-01-27 22:10:19,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 662 transitions, 11787 flow [2023-01-27 22:10:20,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 662 transitions, 11340 flow, removed 0 selfloop flow, removed 16 redundant places. [2023-01-27 22:10:20,363 INFO L231 Difference]: Finished difference. Result has 245 places, 599 transitions, 10005 flow [2023-01-27 22:10:20,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=9435, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=285, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10005, PETRI_PLACES=245, PETRI_TRANSITIONS=599} [2023-01-27 22:10:20,364 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2023-01-27 22:10:20,364 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 599 transitions, 10005 flow [2023-01-27 22:10:20,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 100.1) internal successors, (2002), 20 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:10:20,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:10:20,365 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:10:20,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-01-27 22:10:20,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-01-27 22:10:20,565 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:10:20,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:10:20,566 INFO L85 PathProgramCache]: Analyzing trace with hash -567491001, now seen corresponding path program 3 times [2023-01-27 22:10:20,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:10:20,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70318613] [2023-01-27 22:10:20,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:10:20,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:10:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:10:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:10:23,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:10:23,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70318613] [2023-01-27 22:10:23,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70318613] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:10:23,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470507654] [2023-01-27 22:10:23,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:10:23,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:10:23,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:10:23,491 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:10:23,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-01-27 22:10:23,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 22:10:23,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:10:23,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 59 conjunts are in the unsatisfiable core [2023-01-27 22:10:23,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:10:23,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 22:10:23,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 22:10:24,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:10:24,165 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 86 treesize of output 70 [2023-01-27 22:10:24,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:10:24,367 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 86 treesize of output 70 [2023-01-27 22:10:25,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:10:25,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 89 [2023-01-27 22:10:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:10:26,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:10:29,144 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~min1~0 1))) (let ((.cse2 (<= c_~min3~0 c_~min1~0)) (.cse3 (<= c_~min1~0 c_~min3~0)) (.cse1 (<= c_~min1~0 c_~min2~0)) (.cse0 (< c_~min2~0 .cse8))) (and (or (and (<= c_~min2~0 c_~min3~0) .cse0 .cse1) (and .cse2 .cse1 .cse3) (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (< (select .cse4 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))) c_~min3~0) (< (select .cse4 c_~A~0.offset) c_~min2~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))) (forall ((v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse7 (select .cse6 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (let ((.cse5 (select .cse6 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 .cse5) (<= .cse5 c_~min1~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0)))) (<= c_~min2~0 .cse7) (< .cse7 .cse8))))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse9 (select .cse10 c_~A~0.offset))) (or (<= c_~min2~0 .cse9) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (< (select .cse10 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))) c_~min3~0) (< .cse9 .cse8) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))) .cse2) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse11 (select .cse12 c_~A~0.offset))) (or (<= c_~min2~0 .cse11) (<= .cse11 c_~min3~0) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (< (select .cse12 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))) .cse3) (or .cse1 (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 (select .cse13 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4)))) (< (select .cse13 c_~A~0.offset) c_~min2~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse14 (select .cse15 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 .cse14) (< (select .cse15 c_~A~0.offset) c_~min2~0) (<= .cse14 c_~min1~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))) .cse0) (forall ((v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse16 (select .cse18 c_~A~0.offset))) (or (<= c_~min2~0 .cse16) (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (let ((.cse17 (select .cse18 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))))) (or (<= c_~min1~0 .cse17) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 .cse17) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0) (<= .cse16 .cse17)))))))) (forall ((v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse19 (select .cse20 c_~A~0.offset))) (or (<= c_~min2~0 .cse19) (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 (select .cse20 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4)))) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))) (<= c_~min1~0 .cse19))))) (forall ((v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (or (< (select .cse21 c_~A~0.offset) c_~min2~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int)) (let ((.cse22 (select .cse21 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))))) (or (<= c_~min1~0 .cse22) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (<= c_~min3~0 .cse22) (<= c_~min2~0 .cse22) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0))))))) (forall ((v_thread3Thread1of1ForFork0_~i~2_109 Int) (v_ArrVal_1040 (Array Int Int))) (or (forall ((v_ArrVal_1041 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1041) c_~A~0.base))) (let ((.cse23 (select .cse24 c_~A~0.offset))) (or (<= c_~min2~0 .cse23) (< (select .cse24 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_109 4))) c_~min3~0) (<= c_~min1~0 .cse23))))) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_109) (< (+ v_thread3Thread1of1ForFork0_~i~2_109 1) c_~N~0)))))) is different from false [2023-01-27 22:10:38,838 WARN L222 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 180 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:11:12,095 WARN L222 SmtUtils]: Spent 17.68s on a formula simplification that was a NOOP. DAG size: 250 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:11:13,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:13,908 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 182 treesize of output 110 [2023-01-27 22:11:13,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:13,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1303 treesize of output 1167 [2023-01-27 22:11:13,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:13,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 246 [2023-01-27 22:11:14,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:14,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 210 treesize of output 190 [2023-01-27 22:11:14,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:14,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 210 [2023-01-27 22:11:16,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:16,602 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 201 treesize of output 117 [2023-01-27 22:11:16,653 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-01-27 22:11:16,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5101 treesize of output 4548 [2023-01-27 22:11:16,717 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:16,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:16,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 261 [2023-01-27 22:11:16,788 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:16,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 158 [2023-01-27 22:11:16,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:16,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 155 [2023-01-27 22:11:17,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:17,491 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 156 treesize of output 96 [2023-01-27 22:11:17,526 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:17,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2414 treesize of output 2136 [2023-01-27 22:11:17,608 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:11:17,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 164 [2023-01-27 22:11:17,656 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:17,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 242 treesize of output 214 [2023-01-27 22:11:17,693 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:11:17,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 143 [2023-01-27 22:11:17,700 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-27 22:11:18,053 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:18,054 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 148 treesize of output 1 [2023-01-27 22:11:18,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:18,077 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 148 treesize of output 88 [2023-01-27 22:11:18,086 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:18,087 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:18,106 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:18,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 98 [2023-01-27 22:11:18,131 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:18,132 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 54 treesize of output 40 [2023-01-27 22:11:18,210 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:18,211 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 131 treesize of output 83 [2023-01-27 22:11:18,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:18,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:18,241 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:18,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 110 [2023-01-27 22:11:18,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:18,274 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 54 treesize of output 52 [2023-01-27 22:11:18,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:18,964 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 107 treesize of output 71 [2023-01-27 22:11:18,972 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:18,972 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:18,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:18,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 91 [2023-01-27 22:11:19,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:19,045 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 43 treesize of output 45 [2023-01-27 22:11:19,275 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:19,276 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 217 treesize of output 1 [2023-01-27 22:11:19,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:19,300 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 150 treesize of output 90 [2023-01-27 22:11:19,308 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:19,308 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:19,333 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:19,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 112 [2023-01-27 22:11:19,381 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:19,382 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 56 treesize of output 52 [2023-01-27 22:11:19,763 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:19,763 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 150 treesize of output 90 [2023-01-27 22:11:19,773 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:19,773 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:19,797 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:19,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 100 [2023-01-27 22:11:19,869 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:19,870 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 56 treesize of output 40 [2023-01-27 22:11:19,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:19,936 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 230 treesize of output 134 [2023-01-27 22:11:19,946 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:19,946 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:19,979 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-01-27 22:11:19,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 273 treesize of output 206 [2023-01-27 22:11:20,014 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:20,014 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 77 treesize of output 49 [2023-01-27 22:11:20,093 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:20,094 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 234 treesize of output 1 [2023-01-27 22:11:20,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:20,131 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 135 treesize of output 87 [2023-01-27 22:11:20,143 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:20,144 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:20,167 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:20,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 96 [2023-01-27 22:11:20,224 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:20,225 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 52 treesize of output 40 [2023-01-27 22:11:20,287 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:20,287 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 157 treesize of output 1 [2023-01-27 22:11:20,316 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:20,316 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 172 treesize of output 1 [2023-01-27 22:11:20,353 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:20,354 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 150 treesize of output 1 [2023-01-27 22:11:20,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:20,378 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 137 treesize of output 89 [2023-01-27 22:11:20,388 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:20,389 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:20,414 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:20,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 100 [2023-01-27 22:11:20,448 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:20,449 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 54 treesize of output 42 [2023-01-27 22:11:20,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:20,541 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 178 treesize of output 106 [2023-01-27 22:11:20,552 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:20,552 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:20,577 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:20,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 117 [2023-01-27 22:11:20,657 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:20,658 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 65 treesize of output 47 [2023-01-27 22:11:20,743 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:20,743 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 156 treesize of output 1 [2023-01-27 22:11:20,776 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:20,776 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 172 treesize of output 1 [2023-01-27 22:11:20,800 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:20,800 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 150 treesize of output 1 [2023-01-27 22:11:20,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:20,834 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 148 treesize of output 88 [2023-01-27 22:11:20,845 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:20,845 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:20,872 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:20,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 98 [2023-01-27 22:11:20,928 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:20,928 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 54 treesize of output 40 [2023-01-27 22:11:21,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:21,019 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 139 treesize of output 91 [2023-01-27 22:11:21,030 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:21,030 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:21,059 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:21,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 100 [2023-01-27 22:11:21,094 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:21,094 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 56 treesize of output 40 [2023-01-27 22:11:21,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:21,181 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 176 treesize of output 104 [2023-01-27 22:11:21,191 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:21,192 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:21,219 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:21,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 98 [2023-01-27 22:11:21,255 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:21,255 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 54 treesize of output 40 [2023-01-27 22:11:21,354 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:21,355 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 169 treesize of output 1 [2023-01-27 22:11:21,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:11:21,419 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 107 treesize of output 71 [2023-01-27 22:11:21,430 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:21,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:11:21,461 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:21,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 79 [2023-01-27 22:11:21,505 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-27 22:11:21,505 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 43 treesize of output 33 [2023-01-27 22:11:21,599 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:21,600 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 226 treesize of output 1 [2023-01-27 22:11:21,639 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:21,639 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 155 treesize of output 1 [2023-01-27 22:11:21,669 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:21,669 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 173 treesize of output 1 [2023-01-27 22:11:21,710 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:21,710 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 205 treesize of output 1 [2023-01-27 22:11:21,746 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:21,746 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 176 treesize of output 1 [2023-01-27 22:11:21,781 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:21,782 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 135 treesize of output 1 [2023-01-27 22:11:21,840 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:21,840 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 131 treesize of output 1 [2023-01-27 22:11:21,876 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:21,876 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 175 treesize of output 1 [2023-01-27 22:11:21,924 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:21,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 1 [2023-01-27 22:11:21,962 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:21,962 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 196 treesize of output 1 [2023-01-27 22:11:22,011 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,012 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 236 treesize of output 1 [2023-01-27 22:11:22,060 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,060 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 174 treesize of output 1 [2023-01-27 22:11:22,096 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,097 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 155 treesize of output 1 [2023-01-27 22:11:22,147 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,147 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 201 treesize of output 1 [2023-01-27 22:11:22,192 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,192 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 157 treesize of output 1 [2023-01-27 22:11:22,222 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,222 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 176 treesize of output 1 [2023-01-27 22:11:22,261 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,261 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 211 treesize of output 1 [2023-01-27 22:11:22,301 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,301 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 131 treesize of output 1 [2023-01-27 22:11:22,339 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,339 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 173 treesize of output 1 [2023-01-27 22:11:22,367 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,368 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 174 treesize of output 1 [2023-01-27 22:11:22,396 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,396 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 148 treesize of output 1 [2023-01-27 22:11:22,435 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,435 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 192 treesize of output 1 [2023-01-27 22:11:22,475 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,475 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 209 treesize of output 1 [2023-01-27 22:11:22,514 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,514 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 175 treesize of output 1 [2023-01-27 22:11:22,543 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,543 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 159 treesize of output 1 [2023-01-27 22:11:22,584 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,584 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 197 treesize of output 1 [2023-01-27 22:11:22,624 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,624 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 211 treesize of output 1 [2023-01-27 22:11:22,663 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,664 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 186 treesize of output 1 [2023-01-27 22:11:22,693 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,693 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 131 treesize of output 1 [2023-01-27 22:11:22,724 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 22:11:22,725 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 135 treesize of output 1 [2023-01-27 22:11:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:11:23,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470507654] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:11:23,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:11:23,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 39 [2023-01-27 22:11:23,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956754725] [2023-01-27 22:11:23,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:11:23,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-01-27 22:11:23,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:11:23,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-01-27 22:11:23,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1394, Unknown=18, NotChecked=76, Total=1640 [2023-01-27 22:11:23,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 267 [2023-01-27 22:11:23,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 599 transitions, 10005 flow. Second operand has 41 states, 41 states have (on average 70.82926829268293) internal successors, (2904), 41 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:11:23,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:11:23,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 267 [2023-01-27 22:11:23,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:11:45,956 WARN L222 SmtUtils]: Spent 8.79s on a formula simplification. DAG size of input: 268 DAG size of output: 124 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:12:07,081 WARN L222 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 232 DAG size of output: 107 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:12:09,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:19,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:22,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:24,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:25,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:28,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:30,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:32,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:34,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:38,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:40,202 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-27 22:12:42,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:43,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:46,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:50,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:52,779 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-27 22:12:54,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:56,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:12:59,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:16:31,918 WARN L222 SmtUtils]: Spent 3.42m on a formula simplification. DAG size of input: 326 DAG size of output: 186 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:16:34,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:16:37,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:16:39,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:18:47,855 WARN L222 SmtUtils]: Spent 1.93m on a formula simplification. DAG size of input: 279 DAG size of output: 171 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:18:50,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:18:56,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:19:07,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:19:09,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:19:27,113 WARN L222 SmtUtils]: Spent 15.06s on a formula simplification. DAG size of input: 336 DAG size of output: 138 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:19:29,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:19:31,240 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-27 22:19:33,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:19:48,422 WARN L222 SmtUtils]: Spent 7.09s on a formula simplification. DAG size of input: 300 DAG size of output: 137 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:19:50,529 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-27 22:19:51,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:20:12,112 WARN L222 SmtUtils]: Spent 6.94s on a formula simplification. DAG size of input: 301 DAG size of output: 138 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:20:23,229 WARN L222 SmtUtils]: Spent 8.40s on a formula simplification. DAG size of input: 297 DAG size of output: 125 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:20:25,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:20:28,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:20:30,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:20:33,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:20:35,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:20:38,668 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-27 22:22:40,794 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 22:22:40,794 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 22:22:40,919 WARN L238 SmtUtils]: Removed 11 from assertion stack [2023-01-27 22:22:40,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-01-27 22:22:40,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-27 22:22:40,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-01-27 22:22:41,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:22:41,121 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 326 for 107792ms.. [2023-01-27 22:22:41,123 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-01-27 22:22:41,123 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-01-27 22:22:41,123 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-01-27 22:22:41,123 INFO L445 BasicCegarLoop]: Path program histogram: [18, 3, 1, 1] [2023-01-27 22:22:41,125 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 22:22:41,125 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 22:22:41,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 10:22:41 BasicIcfg [2023-01-27 22:22:41,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 22:22:41,128 INFO L158 Benchmark]: Toolchain (without parser) took 839217.11ms. Allocated memory was 348.1MB in the beginning and 8.4GB in the end (delta: 8.1GB). Free memory was 296.3MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 4.9GB. Max. memory is 16.0GB. [2023-01-27 22:22:41,128 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 348.1MB. Free memory is still 299.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 22:22:41,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.42ms. Allocated memory is still 348.1MB. Free memory was 296.0MB in the beginning and 284.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-27 22:22:41,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.90ms. Allocated memory is still 348.1MB. Free memory was 284.5MB in the beginning and 282.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 22:22:41,128 INFO L158 Benchmark]: Boogie Preprocessor took 45.56ms. Allocated memory is still 348.1MB. Free memory was 282.7MB in the beginning and 281.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 22:22:41,128 INFO L158 Benchmark]: RCFGBuilder took 514.86ms. Allocated memory is still 348.1MB. Free memory was 281.2MB in the beginning and 260.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-01-27 22:22:41,129 INFO L158 Benchmark]: TraceAbstraction took 838314.74ms. Allocated memory was 348.1MB in the beginning and 8.4GB in the end (delta: 8.1GB). Free memory was 259.6MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 4.9GB. Max. memory is 16.0GB. [2023-01-27 22:22:41,129 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.14ms. Allocated memory is still 348.1MB. Free memory is still 299.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 279.42ms. Allocated memory is still 348.1MB. Free memory was 296.0MB in the beginning and 284.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 49.90ms. Allocated memory is still 348.1MB. Free memory was 284.5MB in the beginning and 282.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.56ms. Allocated memory is still 348.1MB. Free memory was 282.7MB in the beginning and 281.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 514.86ms. Allocated memory is still 348.1MB. Free memory was 281.2MB in the beginning and 260.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 838314.74ms. Allocated memory was 348.1MB in the beginning and 8.4GB in the end (delta: 8.1GB). Free memory was 259.6MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 4.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 130 PlacesBefore, 30 PlacesAfterwards, 132 TransitionsBefore, 24 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 7 FixpointIterations, 69 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 122 TotalNumberOfCompositions, 1523 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1423, independent: 1404, independent conditional: 0, independent unconditional: 1404, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 717, independent: 708, independent conditional: 0, independent unconditional: 708, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1423, independent: 696, independent conditional: 0, independent unconditional: 696, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 717, unknown conditional: 0, unknown unconditional: 717] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 326 for 107792ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 326 for 107792ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 326 for 107792ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 326 for 107792ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 164 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 838.1s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 737.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 55 mSolverCounterUnknown, 4140 SdHoareTripleChecker+Valid, 105.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4140 mSDsluCounter, 1086 SdHoareTripleChecker+Invalid, 102.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 924 IncrementalHoareTripleChecker+Unchecked, 954 mSDsCounter, 215 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15503 IncrementalHoareTripleChecker+Invalid, 16697 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 215 mSolverCounterUnsat, 132 mSDtfsCounter, 15503 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1551 GetRequests, 759 SyntacticMatches, 44 SemanticMatches, 747 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 7523 ImplicationChecksByTransitivity, 513.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17268occurred in iteration=10, InterpolantAutomatonStates: 406, 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.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 88.5s InterpolantComputationTime, 1078 NumberOfCodeBlocks, 1067 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1540 ConstructedInterpolants, 38 QuantifiedInterpolants, 46357 SizeOfPredicates, 244 NumberOfNonLiveVariables, 4729 ConjunctsInSsa, 445 ConjunctsInUnsatCore, 67 InterpolantComputations, 2 PerfectInterpolantSequences, 145/330 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