/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 11:06:43,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 11:06:43,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 11:06:43,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 11:06:43,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 11:06:43,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 11:06:43,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 11:06:43,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 11:06:43,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 11:06:43,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 11:06:43,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 11:06:43,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 11:06:43,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 11:06:43,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 11:06:43,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 11:06:43,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 11:06:43,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 11:06:43,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 11:06:43,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 11:06:43,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 11:06:43,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 11:06:43,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 11:06:43,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 11:06:43,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 11:06:43,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 11:06:43,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 11:06:43,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 11:06:43,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 11:06:43,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 11:06:43,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 11:06:43,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 11:06:43,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 11:06:43,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 11:06:43,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 11:06:43,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 11:06:43,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 11:06:43,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 11:06:43,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 11:06:43,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 11:06:43,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 11:06:43,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 11:06:43,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 11:06:43,450 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 11:06:43,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 11:06:43,451 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 11:06:43,451 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 11:06:43,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 11:06:43,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 11:06:43,453 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 11:06:43,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 11:06:43,453 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 11:06:43,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 11:06:43,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 11:06:43,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 11:06:43,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 11:06:43,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 11:06:43,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 11:06:43,454 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 11:06:43,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 11:06:43,455 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 11:06:43,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 11:06:43,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 11:06:43,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 11:06:43,455 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 11:06:43,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 11:06:43,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 11:06:43,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 11:06:43,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 11:06:43,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 11:06:43,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 11:06:43,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 11:06:43,456 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 11:06:43,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 11:06:43,457 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 11:06:43,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 11:06:43,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 11:06:43,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 11:06:43,709 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 11:06:43,709 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 11:06:43,710 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2023-01-28 11:06:44,780 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 11:06:44,948 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 11:06:44,949 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2023-01-28 11:06:44,955 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d2dc490/93bd60e425604ed2a73d94b7984c3b2b/FLAG2bda0bd6d [2023-01-28 11:06:44,968 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d2dc490/93bd60e425604ed2a73d94b7984c3b2b [2023-01-28 11:06:44,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 11:06:44,971 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 11:06:44,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 11:06:44,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 11:06:44,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 11:06:44,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:06:44" (1/1) ... [2023-01-28 11:06:44,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3e0258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:06:44, skipping insertion in model container [2023-01-28 11:06:44,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:06:44" (1/1) ... [2023-01-28 11:06:44,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 11:06:45,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 11:06:45,150 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.wvr.c[2553,2566] [2023-01-28 11:06:45,161 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 11:06:45,167 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 11:06:45,183 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.wvr.c[2553,2566] [2023-01-28 11:06:45,186 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 11:06:45,192 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 11:06:45,192 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 11:06:45,197 INFO L208 MainTranslator]: Completed translation [2023-01-28 11:06:45,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:06:45 WrapperNode [2023-01-28 11:06:45,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 11:06:45,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 11:06:45,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 11:06:45,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 11:06:45,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:06:45" (1/1) ... [2023-01-28 11:06:45,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:06:45" (1/1) ... [2023-01-28 11:06:45,236 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 104 [2023-01-28 11:06:45,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 11:06:45,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 11:06:45,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 11:06:45,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 11:06:45,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:06:45" (1/1) ... [2023-01-28 11:06:45,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:06:45" (1/1) ... [2023-01-28 11:06:45,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:06:45" (1/1) ... [2023-01-28 11:06:45,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:06:45" (1/1) ... [2023-01-28 11:06:45,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:06:45" (1/1) ... [2023-01-28 11:06:45,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:06:45" (1/1) ... [2023-01-28 11:06:45,258 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:06:45" (1/1) ... [2023-01-28 11:06:45,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:06:45" (1/1) ... [2023-01-28 11:06:45,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 11:06:45,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 11:06:45,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 11:06:45,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 11:06:45,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:06:45" (1/1) ... [2023-01-28 11:06:45,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 11:06:45,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:06:45,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 11:06:45,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 11:06:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 11:06:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 11:06:45,359 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 11:06:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 11:06:45,359 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 11:06:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 11:06:45,359 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 11:06:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 11:06:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 11:06:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 11:06:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 11:06:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 11:06:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 11:06:45,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 11:06:45,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 11:06:45,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 11:06:45,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 11:06:45,362 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 11:06:45,450 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 11:06:45,452 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 11:06:45,733 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 11:06:45,799 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 11:06:45,800 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-28 11:06:45,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:06:45 BoogieIcfgContainer [2023-01-28 11:06:45,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 11:06:45,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 11:06:45,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 11:06:45,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 11:06:45,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:06:44" (1/3) ... [2023-01-28 11:06:45,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c11653b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:06:45, skipping insertion in model container [2023-01-28 11:06:45,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:06:45" (2/3) ... [2023-01-28 11:06:45,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c11653b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:06:45, skipping insertion in model container [2023-01-28 11:06:45,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:06:45" (3/3) ... [2023-01-28 11:06:45,808 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2023-01-28 11:06:45,821 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 11:06:45,822 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 11:06:45,822 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 11:06:45,882 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-28 11:06:45,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 144 transitions, 312 flow [2023-01-28 11:06:45,961 INFO L130 PetriNetUnfolder]: 12/141 cut-off events. [2023-01-28 11:06:45,962 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 11:06:45,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 12/141 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/128 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-01-28 11:06:45,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 144 transitions, 312 flow [2023-01-28 11:06:45,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 131 transitions, 280 flow [2023-01-28 11:06:45,977 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 11:06:45,984 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 131 transitions, 280 flow [2023-01-28 11:06:45,986 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 131 transitions, 280 flow [2023-01-28 11:06:45,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 131 transitions, 280 flow [2023-01-28 11:06:46,021 INFO L130 PetriNetUnfolder]: 12/131 cut-off events. [2023-01-28 11:06:46,021 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 11:06:46,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 12/131 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/119 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-01-28 11:06:46,023 INFO L119 LiptonReduction]: Number of co-enabled transitions 1320 [2023-01-28 11:06:50,270 INFO L134 LiptonReduction]: Checked pairs total: 1615 [2023-01-28 11:06:50,270 INFO L136 LiptonReduction]: Total number of compositions: 129 [2023-01-28 11:06:50,283 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 11:06:50,288 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;@1ec66afc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 11:06:50,288 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 11:06:50,293 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2023-01-28 11:06:50,294 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 11:06:50,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:06:50,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:06:50,295 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:06:50,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:06:50,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1107178468, now seen corresponding path program 1 times [2023-01-28 11:06:50,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:06:50,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691188774] [2023-01-28 11:06:50,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:06:50,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:06:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:06:51,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:06:51,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:06:51,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691188774] [2023-01-28 11:06:51,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691188774] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:06:51,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:06:51,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 11:06:51,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509357693] [2023-01-28 11:06:51,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:06:51,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 11:06:51,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:06:51,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 11:06:51,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 11:06:51,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 273 [2023-01-28 11:06:51,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:51,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:06:51,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 273 [2023-01-28 11:06:51,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:06:51,337 INFO L130 PetriNetUnfolder]: 679/943 cut-off events. [2023-01-28 11:06:51,337 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-01-28 11:06:51,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1970 conditions, 943 events. 679/943 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3493 event pairs, 265 based on Foata normal form. 0/618 useless extension candidates. Maximal degree in co-relation 765. Up to 370 conditions per place. [2023-01-28 11:06:51,348 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 55 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2023-01-28 11:06:51,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 65 transitions, 304 flow [2023-01-28 11:06:51,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 11:06:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 11:06:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 765 transitions. [2023-01-28 11:06:51,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4003139717425432 [2023-01-28 11:06:51,370 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 765 transitions. [2023-01-28 11:06:51,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 765 transitions. [2023-01-28 11:06:51,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:06:51,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 765 transitions. [2023-01-28 11:06:51,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:51,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:51,389 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:51,391 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 7 states and 765 transitions. [2023-01-28 11:06:51,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 65 transitions, 304 flow [2023-01-28 11:06:51,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 65 transitions, 272 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-01-28 11:06:51,400 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 97 flow [2023-01-28 11:06:51,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=97, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2023-01-28 11:06:51,405 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-01-28 11:06:51,405 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 97 flow [2023-01-28 11:06:51,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:51,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:06:51,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:06:51,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 11:06:51,406 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:06:51,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:06:51,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1966737023, now seen corresponding path program 1 times [2023-01-28 11:06:51,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:06:51,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332701924] [2023-01-28 11:06:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:06:51,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:06:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:06:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:06:51,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:06:51,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332701924] [2023-01-28 11:06:51,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332701924] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:06:51,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:06:51,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 11:06:51,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758713260] [2023-01-28 11:06:51,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:06:51,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 11:06:51,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:06:51,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 11:06:51,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 11:06:51,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 273 [2023-01-28 11:06:51,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:51,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:06:51,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 273 [2023-01-28 11:06:51,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:06:51,738 INFO L130 PetriNetUnfolder]: 342/475 cut-off events. [2023-01-28 11:06:51,739 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2023-01-28 11:06:51,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 475 events. 342/475 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1468 event pairs, 133 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 1137. Up to 371 conditions per place. [2023-01-28 11:06:51,742 INFO L137 encePairwiseOnDemand]: 269/273 looper letters, 30 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-01-28 11:06:51,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 168 flow [2023-01-28 11:06:51,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 11:06:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 11:06:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2023-01-28 11:06:51,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3965201465201465 [2023-01-28 11:06:51,743 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 433 transitions. [2023-01-28 11:06:51,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 433 transitions. [2023-01-28 11:06:51,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:06:51,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 433 transitions. [2023-01-28 11:06:51,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:51,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:51,747 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:51,747 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 97 flow. Second operand 4 states and 433 transitions. [2023-01-28 11:06:51,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 168 flow [2023-01-28 11:06:51,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 157 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-28 11:06:51,752 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 77 flow [2023-01-28 11:06:51,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=77, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2023-01-28 11:06:51,753 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-01-28 11:06:51,753 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 77 flow [2023-01-28 11:06:51,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:51,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:06:51,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:06:51,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 11:06:51,754 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:06:51,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:06:51,757 INFO L85 PathProgramCache]: Analyzing trace with hash -805618038, now seen corresponding path program 1 times [2023-01-28 11:06:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:06:51,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771277554] [2023-01-28 11:06:51,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:06:51,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:06:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:06:51,851 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-28 11:06:51,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:06:51,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771277554] [2023-01-28 11:06:51,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771277554] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:06:51,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533324121] [2023-01-28 11:06:51,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:06:51,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:06:51,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:06:51,865 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:06:51,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 11:06:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:06:51,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 11:06:51,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:06:52,084 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-28 11:06:52,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:06:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:06:52,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533324121] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 11:06:52,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 11:06:52,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-01-28 11:06:52,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717032205] [2023-01-28 11:06:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:06:52,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 11:06:52,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:06:52,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 11:06:52,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-01-28 11:06:52,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 273 [2023-01-28 11:06:52,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 77 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:52,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:06:52,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 273 [2023-01-28 11:06:52,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:06:52,216 INFO L130 PetriNetUnfolder]: 311/453 cut-off events. [2023-01-28 11:06:52,217 INFO L131 PetriNetUnfolder]: For 117/143 co-relation queries the response was YES. [2023-01-28 11:06:52,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 453 events. 311/453 cut-off events. For 117/143 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1443 event pairs, 73 based on Foata normal form. 26/371 useless extension candidates. Maximal degree in co-relation 1011. Up to 349 conditions per place. [2023-01-28 11:06:52,220 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 31 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2023-01-28 11:06:52,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 177 flow [2023-01-28 11:06:52,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 11:06:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 11:06:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2023-01-28 11:06:52,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40586080586080586 [2023-01-28 11:06:52,222 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 554 transitions. [2023-01-28 11:06:52,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 554 transitions. [2023-01-28 11:06:52,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:06:52,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 554 transitions. [2023-01-28 11:06:52,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:52,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:52,226 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:52,226 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 77 flow. Second operand 5 states and 554 transitions. [2023-01-28 11:06:52,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 177 flow [2023-01-28 11:06:52,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 171 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 11:06:52,228 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 88 flow [2023-01-28 11:06:52,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-01-28 11:06:52,229 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-01-28 11:06:52,229 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 88 flow [2023-01-28 11:06:52,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:52,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:06:52,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:06:52,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-28 11:06:52,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:06:52,436 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:06:52,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:06:52,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1619003621, now seen corresponding path program 1 times [2023-01-28 11:06:52,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:06:52,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813230117] [2023-01-28 11:06:52,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:06:52,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:06:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:06:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:06:53,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:06:53,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813230117] [2023-01-28 11:06:53,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813230117] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:06:53,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651084652] [2023-01-28 11:06:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:06:53,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:06:53,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:06:53,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:06:53,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 11:06:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:06:53,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2023-01-28 11:06:53,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:06:53,784 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-01-28 11:06:53,785 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-28 11:06:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:06:53,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:06:54,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:06:54,001 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 85 treesize of output 45 [2023-01-28 11:06:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:06:54,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651084652] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:06:54,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:06:54,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-01-28 11:06:54,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822146743] [2023-01-28 11:06:54,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:06:54,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 11:06:54,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:06:54,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 11:06:54,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2023-01-28 11:06:54,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 273 [2023-01-28 11:06:54,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 88 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-28 11:06:54,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:06:54,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 273 [2023-01-28 11:06:54,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:06:54,817 INFO L130 PetriNetUnfolder]: 599/864 cut-off events. [2023-01-28 11:06:54,817 INFO L131 PetriNetUnfolder]: For 286/286 co-relation queries the response was YES. [2023-01-28 11:06:54,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2226 conditions, 864 events. 599/864 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3184 event pairs, 84 based on Foata normal form. 1/639 useless extension candidates. Maximal degree in co-relation 1966. Up to 639 conditions per place. [2023-01-28 11:06:54,823 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 64 selfloop transitions, 25 changer transitions 1/91 dead transitions. [2023-01-28 11:06:54,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 91 transitions, 453 flow [2023-01-28 11:06:54,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 11:06:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 11:06:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 907 transitions. [2023-01-28 11:06:54,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3322344322344322 [2023-01-28 11:06:54,826 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 907 transitions. [2023-01-28 11:06:54,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 907 transitions. [2023-01-28 11:06:54,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:06:54,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 907 transitions. [2023-01-28 11:06:54,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 90.7) internal successors, (907), 10 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:54,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:54,834 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:54,835 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 88 flow. Second operand 10 states and 907 transitions. [2023-01-28 11:06:54,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 91 transitions, 453 flow [2023-01-28 11:06:54,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 91 transitions, 431 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-01-28 11:06:54,839 INFO L231 Difference]: Finished difference. Result has 45 places, 50 transitions, 230 flow [2023-01-28 11:06:54,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=230, PETRI_PLACES=45, PETRI_TRANSITIONS=50} [2023-01-28 11:06:54,840 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2023-01-28 11:06:54,840 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 50 transitions, 230 flow [2023-01-28 11:06:54,841 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-28 11:06:54,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:06:54,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:06:54,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 11:06:55,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-01-28 11:06:55,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:06:55,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:06:55,048 INFO L85 PathProgramCache]: Analyzing trace with hash 431023461, now seen corresponding path program 2 times [2023-01-28 11:06:55,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:06:55,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323187672] [2023-01-28 11:06:55,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:06:55,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:06:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:06:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:06:55,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:06:55,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323187672] [2023-01-28 11:06:55,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323187672] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:06:55,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036292180] [2023-01-28 11:06:55,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 11:06:55,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:06:55,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:06:55,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:06:55,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 11:06:55,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:06:55,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:06:55,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2023-01-28 11:06:55,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:06:56,152 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:06:56,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:06:56,154 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-28 11:06:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:06:56,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:06:56,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:06:56,323 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 85 treesize of output 45 [2023-01-28 11:06:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:06:56,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036292180] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:06:56,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:06:56,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 23 [2023-01-28 11:06:56,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265635648] [2023-01-28 11:06:56,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:06:56,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-28 11:06:56,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:06:56,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-28 11:06:56,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2023-01-28 11:06:56,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 273 [2023-01-28 11:06:56,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 50 transitions, 230 flow. Second operand has 25 states, 25 states have (on average 81.52) internal successors, (2038), 25 states have internal predecessors, (2038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:56,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:06:56,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 273 [2023-01-28 11:06:56,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:06:57,720 INFO L130 PetriNetUnfolder]: 843/1253 cut-off events. [2023-01-28 11:06:57,720 INFO L131 PetriNetUnfolder]: For 848/848 co-relation queries the response was YES. [2023-01-28 11:06:57,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3830 conditions, 1253 events. 843/1253 cut-off events. For 848/848 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4605 event pairs, 128 based on Foata normal form. 16/1269 useless extension candidates. Maximal degree in co-relation 2872. Up to 832 conditions per place. [2023-01-28 11:06:57,728 INFO L137 encePairwiseOnDemand]: 261/273 looper letters, 98 selfloop transitions, 57 changer transitions 7/162 dead transitions. [2023-01-28 11:06:57,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 162 transitions, 949 flow [2023-01-28 11:06:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-28 11:06:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-01-28 11:06:57,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1811 transitions. [2023-01-28 11:06:57,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31589045874760163 [2023-01-28 11:06:57,734 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1811 transitions. [2023-01-28 11:06:57,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1811 transitions. [2023-01-28 11:06:57,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:06:57,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1811 transitions. [2023-01-28 11:06:57,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 86.23809523809524) internal successors, (1811), 21 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:57,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 273.0) internal successors, (6006), 22 states have internal predecessors, (6006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:57,772 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 273.0) internal successors, (6006), 22 states have internal predecessors, (6006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:57,772 INFO L175 Difference]: Start difference. First operand has 45 places, 50 transitions, 230 flow. Second operand 21 states and 1811 transitions. [2023-01-28 11:06:57,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 162 transitions, 949 flow [2023-01-28 11:06:57,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 162 transitions, 943 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-01-28 11:06:57,779 INFO L231 Difference]: Finished difference. Result has 76 places, 88 transitions, 625 flow [2023-01-28 11:06:57,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=625, PETRI_PLACES=76, PETRI_TRANSITIONS=88} [2023-01-28 11:06:57,779 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2023-01-28 11:06:57,779 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 88 transitions, 625 flow [2023-01-28 11:06:57,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 81.52) internal successors, (2038), 25 states have internal predecessors, (2038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:06:57,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:06:57,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:06:57,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 11:06:57,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:06:57,981 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:06:57,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:06:57,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1301817307, now seen corresponding path program 3 times [2023-01-28 11:06:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:06:57,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003001792] [2023-01-28 11:06:57,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:06:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:06:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:06:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:06:58,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:06:58,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003001792] [2023-01-28 11:06:58,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003001792] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:06:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254342953] [2023-01-28 11:06:58,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 11:06:58,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:06:58,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:06:58,563 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:06:58,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 11:06:58,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 11:06:58,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:06:58,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2023-01-28 11:06:58,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:06:59,021 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:06:59,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:06:59,024 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-28 11:06:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:06:59,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:06:59,214 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:06:59,214 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 85 treesize of output 45 [2023-01-28 11:06:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:06:59,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254342953] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:06:59,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:06:59,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-01-28 11:06:59,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223349009] [2023-01-28 11:06:59,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:06:59,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 11:06:59,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:06:59,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 11:06:59,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2023-01-28 11:06:59,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 273 [2023-01-28 11:06:59,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 88 transitions, 625 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-28 11:06:59,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:06:59,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 273 [2023-01-28 11:06:59,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:00,348 INFO L130 PetriNetUnfolder]: 1085/1624 cut-off events. [2023-01-28 11:07:00,348 INFO L131 PetriNetUnfolder]: For 3498/3528 co-relation queries the response was YES. [2023-01-28 11:07:00,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6522 conditions, 1624 events. 1085/1624 cut-off events. For 3498/3528 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6901 event pairs, 159 based on Foata normal form. 32/1632 useless extension candidates. Maximal degree in co-relation 6485. Up to 958 conditions per place. [2023-01-28 11:07:00,362 INFO L137 encePairwiseOnDemand]: 260/273 looper letters, 106 selfloop transitions, 62 changer transitions 4/177 dead transitions. [2023-01-28 11:07:00,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 177 transitions, 1332 flow [2023-01-28 11:07:00,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 11:07:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 11:07:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1192 transitions. [2023-01-28 11:07:00,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.335869258946182 [2023-01-28 11:07:00,366 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1192 transitions. [2023-01-28 11:07:00,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1192 transitions. [2023-01-28 11:07:00,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:00,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1192 transitions. [2023-01-28 11:07:00,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.6923076923077) internal successors, (1192), 13 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:00,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 273.0) internal successors, (3822), 14 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:00,374 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 273.0) internal successors, (3822), 14 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:00,374 INFO L175 Difference]: Start difference. First operand has 76 places, 88 transitions, 625 flow. Second operand 13 states and 1192 transitions. [2023-01-28 11:07:00,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 177 transitions, 1332 flow [2023-01-28 11:07:00,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 177 transitions, 1293 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-01-28 11:07:00,388 INFO L231 Difference]: Finished difference. Result has 91 places, 111 transitions, 940 flow [2023-01-28 11:07:00,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=940, PETRI_PLACES=91, PETRI_TRANSITIONS=111} [2023-01-28 11:07:00,390 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 61 predicate places. [2023-01-28 11:07:00,390 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 111 transitions, 940 flow [2023-01-28 11:07:00,391 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-28 11:07:00,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:00,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:07:00,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 11:07:00,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:00,603 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:07:00,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:07:00,604 INFO L85 PathProgramCache]: Analyzing trace with hash -864561951, now seen corresponding path program 4 times [2023-01-28 11:07:00,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:07:00,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529677224] [2023-01-28 11:07:00,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:00,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:07:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:07:01,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:07:01,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529677224] [2023-01-28 11:07:01,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529677224] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:07:01,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219598338] [2023-01-28 11:07:01,415 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 11:07:01,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:01,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:07:01,419 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:07:01,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 11:07:01,516 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 11:07:01,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:07:01,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-28 11:07:01,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:07:01,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 11:07:01,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 11:07:01,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 11:07:01,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:07:01,945 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-28 11:07:02,108 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:07:02,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:07:02,110 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-28 11:07:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:07:02,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:07:02,300 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) .cse1))) (or (<= c_~min2~0 .cse0) (= c_~min1~0 .cse0)))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_265 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) .cse1) c_~min2~0))))) is different from false [2023-01-28 11:07:03,035 WARN L839 $PredicateComparison]: unable to prove that (and (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (or (< 0 ~M~0) (< ~M~0 0) (< (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0))))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (or (< (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~min1~0 .cse2) (<= c_~min2~0 .cse2))))))) (< 0 ~M~0) (< ~M~0 0))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= c_~min1~0 .cse3) (forall ((v_ArrVal_265 (Array Int Int))) (< (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0)) (= c_~min2~0 .cse3))))) (< 0 ~M~0) (< ~M~0 0))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_264))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= c_~min1~0 .cse5) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= c_~min2~0 .cse6) (= .cse6 .cse5))))))))))) is different from false [2023-01-28 11:07:03,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:07:03,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 76 [2023-01-28 11:07:03,138 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:07:03,139 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 1730 treesize of output 1586 [2023-01-28 11:07:03,179 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:07:03,180 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 322 treesize of output 290 [2023-01-28 11:07:03,200 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 220 treesize of output 172 [2023-01-28 11:07:03,213 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:07:03,213 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 122 treesize of output 108 [2023-01-28 11:07:03,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:07:03,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2023-01-28 11:07:03,281 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:07:03,287 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:07:03,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 170 [2023-01-28 11:07:03,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:07:03,299 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 89 treesize of output 75 [2023-01-28 11:07:03,309 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:07:03,309 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 152 treesize of output 128 [2023-01-28 11:07:03,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:07:03,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 59 [2023-01-28 11:07:03,389 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:07:03,396 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:07:03,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 372 treesize of output 344 [2023-01-28 11:07:03,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:07:03,418 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 74 treesize of output 64 [2023-01-28 11:07:03,446 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:07:03,446 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 81 treesize of output 65 [2023-01-28 11:07:03,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:07:03,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 46 [2023-01-28 11:07:03,485 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:07:03,492 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:07:03,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 111 [2023-01-28 11:07:03,505 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:07:03,505 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 107 treesize of output 95 [2023-01-28 11:07:03,518 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:07:03,519 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 49 treesize of output 45 [2023-01-28 11:07:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-28 11:07:03,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219598338] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:07:03,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:07:03,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2023-01-28 11:07:03,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894498676] [2023-01-28 11:07:03,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:07:03,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-28 11:07:03,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:07:03,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-28 11:07:03,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=699, Unknown=3, NotChecked=110, Total=930 [2023-01-28 11:07:03,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 273 [2023-01-28 11:07:03,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 111 transitions, 940 flow. Second operand has 31 states, 31 states have (on average 73.93548387096774) internal successors, (2292), 31 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:03,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:07:03,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 273 [2023-01-28 11:07:03,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:05,535 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0))) (and (or .cse0 (<= (+ c_thread3Thread1of1ForFork0_~i~2 1) c_~N~0)) (or (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) .cse2))) (or (<= c_~min2~0 .cse1) (= c_~min1~0 .cse1)))) (or .cse0 (forall ((v_ArrVal_265 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_265) c_~A~0.base) .cse2) c_~min2~0))))) (< c_thread1Thread1of1ForFork1_~i~0 c_~N~0)))) is different from false [2023-01-28 11:07:12,597 WARN L222 SmtUtils]: Spent 6.95s on a formula simplification. DAG size of input: 88 DAG size of output: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:07:21,060 INFO L130 PetriNetUnfolder]: 1889/2864 cut-off events. [2023-01-28 11:07:21,060 INFO L131 PetriNetUnfolder]: For 10844/10941 co-relation queries the response was YES. [2023-01-28 11:07:21,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13049 conditions, 2864 events. 1889/2864 cut-off events. For 10844/10941 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14242 event pairs, 175 based on Foata normal form. 44/2863 useless extension candidates. Maximal degree in co-relation 13007. Up to 1323 conditions per place. [2023-01-28 11:07:21,085 INFO L137 encePairwiseOnDemand]: 255/273 looper letters, 176 selfloop transitions, 176 changer transitions 6/363 dead transitions. [2023-01-28 11:07:21,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 363 transitions, 3015 flow [2023-01-28 11:07:21,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-28 11:07:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-01-28 11:07:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2578 transitions. [2023-01-28 11:07:21,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2951007326007326 [2023-01-28 11:07:21,094 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 2578 transitions. [2023-01-28 11:07:21,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 2578 transitions. [2023-01-28 11:07:21,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:21,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2578 transitions. [2023-01-28 11:07:21,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 80.5625) internal successors, (2578), 32 states have internal predecessors, (2578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:21,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 273.0) internal successors, (9009), 33 states have internal predecessors, (9009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:21,111 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 273.0) internal successors, (9009), 33 states have internal predecessors, (9009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:21,111 INFO L175 Difference]: Start difference. First operand has 91 places, 111 transitions, 940 flow. Second operand 32 states and 2578 transitions. [2023-01-28 11:07:21,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 363 transitions, 3015 flow [2023-01-28 11:07:21,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 363 transitions, 2882 flow, removed 46 selfloop flow, removed 5 redundant places. [2023-01-28 11:07:21,148 INFO L231 Difference]: Finished difference. Result has 134 places, 227 transitions, 2375 flow [2023-01-28 11:07:21,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2375, PETRI_PLACES=134, PETRI_TRANSITIONS=227} [2023-01-28 11:07:21,150 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 104 predicate places. [2023-01-28 11:07:21,150 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 227 transitions, 2375 flow [2023-01-28 11:07:21,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 73.93548387096774) internal successors, (2292), 31 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:21,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:21,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:07:21,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 11:07:21,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:21,357 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:07:21,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:07:21,357 INFO L85 PathProgramCache]: Analyzing trace with hash -148406021, now seen corresponding path program 5 times [2023-01-28 11:07:21,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:07:21,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723603982] [2023-01-28 11:07:21,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:21,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:07:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:07:21,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:07:21,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723603982] [2023-01-28 11:07:21,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723603982] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:07:21,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430116810] [2023-01-28 11:07:21,898 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 11:07:21,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:21,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:07:21,900 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:07:21,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 11:07:21,985 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-28 11:07:21,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:07:21,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 30 conjunts are in the unsatisfiable core [2023-01-28 11:07:21,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:07:22,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:07:22,332 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 67 [2023-01-28 11:07:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:07:22,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:07:22,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:07:22,705 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 85 treesize of output 45 [2023-01-28 11:07:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:07:22,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430116810] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:07:22,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:07:22,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 22 [2023-01-28 11:07:22,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749742891] [2023-01-28 11:07:22,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:07:22,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-01-28 11:07:22,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:07:22,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-01-28 11:07:22,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2023-01-28 11:07:22,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 273 [2023-01-28 11:07:22,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 227 transitions, 2375 flow. Second operand has 24 states, 24 states have (on average 81.625) internal successors, (1959), 24 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:22,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:07:22,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 273 [2023-01-28 11:07:22,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:26,597 INFO L130 PetriNetUnfolder]: 3048/4523 cut-off events. [2023-01-28 11:07:26,597 INFO L131 PetriNetUnfolder]: For 44013/44013 co-relation queries the response was YES. [2023-01-28 11:07:26,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30208 conditions, 4523 events. 3048/4523 cut-off events. For 44013/44013 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 22239 event pairs, 448 based on Foata normal form. 4/4527 useless extension candidates. Maximal degree in co-relation 30148. Up to 2663 conditions per place. [2023-01-28 11:07:26,644 INFO L137 encePairwiseOnDemand]: 259/273 looper letters, 305 selfloop transitions, 248 changer transitions 12/565 dead transitions. [2023-01-28 11:07:26,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 565 transitions, 7052 flow [2023-01-28 11:07:26,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-01-28 11:07:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-01-28 11:07:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 3953 transitions. [2023-01-28 11:07:26,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31477942347507565 [2023-01-28 11:07:26,655 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 3953 transitions. [2023-01-28 11:07:26,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 3953 transitions. [2023-01-28 11:07:26,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:26,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 3953 transitions. [2023-01-28 11:07:26,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 85.93478260869566) internal successors, (3953), 46 states have internal predecessors, (3953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:26,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 273.0) internal successors, (12831), 47 states have internal predecessors, (12831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:26,679 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 273.0) internal successors, (12831), 47 states have internal predecessors, (12831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:26,679 INFO L175 Difference]: Start difference. First operand has 134 places, 227 transitions, 2375 flow. Second operand 46 states and 3953 transitions. [2023-01-28 11:07:26,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 565 transitions, 7052 flow [2023-01-28 11:07:26,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 565 transitions, 6400 flow, removed 305 selfloop flow, removed 6 redundant places. [2023-01-28 11:07:26,792 INFO L231 Difference]: Finished difference. Result has 186 places, 408 transitions, 4488 flow [2023-01-28 11:07:26,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=4488, PETRI_PLACES=186, PETRI_TRANSITIONS=408} [2023-01-28 11:07:26,793 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 156 predicate places. [2023-01-28 11:07:26,793 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 408 transitions, 4488 flow [2023-01-28 11:07:26,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 81.625) internal successors, (1959), 24 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:26,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:26,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:07:26,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-01-28 11:07:27,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:27,000 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:07:27,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:07:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash -34831059, now seen corresponding path program 6 times [2023-01-28 11:07:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:07:27,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346203611] [2023-01-28 11:07:27,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:27,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:07:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:07:27,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:07:27,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346203611] [2023-01-28 11:07:27,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346203611] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:07:27,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613505205] [2023-01-28 11:07:27,741 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 11:07:27,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:27,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:07:27,745 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:07:27,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-28 11:07:27,841 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-28 11:07:27,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:07:27,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 30 conjunts are in the unsatisfiable core [2023-01-28 11:07:27,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:07:28,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2023-01-28 11:07:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:07:28,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:07:28,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:07:28,252 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 73 treesize of output 45 [2023-01-28 11:07:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:07:28,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613505205] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:07:28,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:07:28,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 22 [2023-01-28 11:07:28,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890194917] [2023-01-28 11:07:28,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:07:28,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-01-28 11:07:28,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:07:28,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-01-28 11:07:28,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2023-01-28 11:07:28,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 273 [2023-01-28 11:07:28,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 408 transitions, 4488 flow. Second operand has 24 states, 24 states have (on average 71.54166666666667) internal successors, (1717), 24 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:28,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:07:28,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 273 [2023-01-28 11:07:28,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:30,290 INFO L130 PetriNetUnfolder]: 3558/5287 cut-off events. [2023-01-28 11:07:30,290 INFO L131 PetriNetUnfolder]: For 54541/54541 co-relation queries the response was YES. [2023-01-28 11:07:30,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36949 conditions, 5287 events. 3558/5287 cut-off events. For 54541/54541 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 26844 event pairs, 774 based on Foata normal form. 4/5285 useless extension candidates. Maximal degree in co-relation 36876. Up to 4469 conditions per place. [2023-01-28 11:07:30,352 INFO L137 encePairwiseOnDemand]: 260/273 looper letters, 401 selfloop transitions, 156 changer transitions 3/560 dead transitions. [2023-01-28 11:07:30,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 560 transitions, 7422 flow [2023-01-28 11:07:30,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-28 11:07:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-01-28 11:07:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1686 transitions. [2023-01-28 11:07:30,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2807192807192807 [2023-01-28 11:07:30,356 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1686 transitions. [2023-01-28 11:07:30,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1686 transitions. [2023-01-28 11:07:30,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:30,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1686 transitions. [2023-01-28 11:07:30,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 76.63636363636364) internal successors, (1686), 22 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:30,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 273.0) internal successors, (6279), 23 states have internal predecessors, (6279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:30,365 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 273.0) internal successors, (6279), 23 states have internal predecessors, (6279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:30,365 INFO L175 Difference]: Start difference. First operand has 186 places, 408 transitions, 4488 flow. Second operand 22 states and 1686 transitions. [2023-01-28 11:07:30,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 560 transitions, 7422 flow [2023-01-28 11:07:30,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 560 transitions, 6418 flow, removed 483 selfloop flow, removed 4 redundant places. [2023-01-28 11:07:30,607 INFO L231 Difference]: Finished difference. Result has 210 places, 474 transitions, 4872 flow [2023-01-28 11:07:30,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=3738, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4872, PETRI_PLACES=210, PETRI_TRANSITIONS=474} [2023-01-28 11:07:30,609 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2023-01-28 11:07:30,609 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 474 transitions, 4872 flow [2023-01-28 11:07:30,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 71.54166666666667) internal successors, (1717), 24 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:30,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:30,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:07:30,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-01-28 11:07:30,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:30,815 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:07:30,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:07:30,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1677275523, now seen corresponding path program 7 times [2023-01-28 11:07:30,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:07:30,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025588579] [2023-01-28 11:07:30,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:30,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:07:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:31,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:07:31,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:07:31,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025588579] [2023-01-28 11:07:31,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025588579] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:07:31,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118479465] [2023-01-28 11:07:31,595 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 11:07:31,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:31,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:07:31,596 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:07:31,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-28 11:07:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:31,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 11:07:31,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:07:31,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:07:31,980 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-28 11:07:32,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:07:32,123 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-28 11:07:32,255 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:07:32,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:07:32,257 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-28 11:07:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:07:32,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:07:32,450 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_399 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_399) c_~A~0.base) .cse0) c_~min2~0))) (forall ((v_ArrVal_399 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_399) c_~A~0.base) .cse0))) (or (<= c_~min2~0 .cse1) (= .cse1 c_~min1~0)))))) is different from false [2023-01-28 11:07:32,493 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_398) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_399) c_~A~0.base) .cse0) c_~min2~0))) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_398) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_399) c_~A~0.base) .cse0))) (or (= c_~min1~0 .cse1) (<= c_~min2~0 .cse1)))))) is different from false [2023-01-28 11:07:32,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:07:32,513 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 331 treesize of output 283 [2023-01-28 11:07:32,523 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 183 treesize of output 159 [2023-01-28 11:07:32,529 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 159 treesize of output 153 [2023-01-28 11:07:32,534 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 153 treesize of output 141 [2023-01-28 11:07:32,539 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-28 11:07:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-28 11:07:32,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118479465] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:07:32,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:07:32,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2023-01-28 11:07:32,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419618310] [2023-01-28 11:07:32,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:07:32,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 11:07:32,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:07:32,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 11:07:32,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=653, Unknown=2, NotChecked=106, Total=870 [2023-01-28 11:07:32,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 273 [2023-01-28 11:07:32,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 474 transitions, 4872 flow. Second operand has 30 states, 30 states have (on average 74.13333333333334) internal successors, (2224), 30 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:32,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:07:32,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 273 [2023-01-28 11:07:32,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:35,274 INFO L130 PetriNetUnfolder]: 4645/6980 cut-off events. [2023-01-28 11:07:35,274 INFO L131 PetriNetUnfolder]: For 70133/70133 co-relation queries the response was YES. [2023-01-28 11:07:35,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46780 conditions, 6980 events. 4645/6980 cut-off events. For 70133/70133 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 38462 event pairs, 420 based on Foata normal form. 72/7044 useless extension candidates. Maximal degree in co-relation 46701. Up to 4575 conditions per place. [2023-01-28 11:07:35,419 INFO L137 encePairwiseOnDemand]: 257/273 looper letters, 471 selfloop transitions, 302 changer transitions 8/781 dead transitions. [2023-01-28 11:07:35,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 781 transitions, 9439 flow [2023-01-28 11:07:35,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-01-28 11:07:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-01-28 11:07:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1891 transitions. [2023-01-28 11:07:35,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3011626055104316 [2023-01-28 11:07:35,422 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1891 transitions. [2023-01-28 11:07:35,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1891 transitions. [2023-01-28 11:07:35,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:35,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1891 transitions. [2023-01-28 11:07:35,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 82.21739130434783) internal successors, (1891), 23 states have internal predecessors, (1891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:35,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 273.0) internal successors, (6552), 24 states have internal predecessors, (6552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:35,431 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 273.0) internal successors, (6552), 24 states have internal predecessors, (6552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:35,432 INFO L175 Difference]: Start difference. First operand has 210 places, 474 transitions, 4872 flow. Second operand 23 states and 1891 transitions. [2023-01-28 11:07:35,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 781 transitions, 9439 flow [2023-01-28 11:07:35,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 781 transitions, 9035 flow, removed 132 selfloop flow, removed 13 redundant places. [2023-01-28 11:07:35,642 INFO L231 Difference]: Finished difference. Result has 228 places, 628 transitions, 6912 flow [2023-01-28 11:07:35,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=4482, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=6912, PETRI_PLACES=228, PETRI_TRANSITIONS=628} [2023-01-28 11:07:35,643 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 198 predicate places. [2023-01-28 11:07:35,643 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 628 transitions, 6912 flow [2023-01-28 11:07:35,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 74.13333333333334) internal successors, (2224), 30 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:35,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:35,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:07:35,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-28 11:07:35,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-01-28 11:07:35,849 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:07:35,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:07:35,849 INFO L85 PathProgramCache]: Analyzing trace with hash 592535917, now seen corresponding path program 1 times [2023-01-28 11:07:35,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:07:35,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547105048] [2023-01-28 11:07:35,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:07:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:07:35,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:07:35,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547105048] [2023-01-28 11:07:35,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547105048] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:07:35,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590937872] [2023-01-28 11:07:35,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:35,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:35,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:07:35,961 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:07:35,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-28 11:07:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:36,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-28 11:07:36,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:07:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:07:36,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:07:36,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:07:36,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590937872] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:07:36,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:07:36,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-01-28 11:07:36,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759777936] [2023-01-28 11:07:36,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:07:36,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-28 11:07:36,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:07:36,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-28 11:07:36,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-01-28 11:07:36,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 273 [2023-01-28 11:07:36,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 628 transitions, 6912 flow. Second operand has 18 states, 18 states have (on average 99.27777777777777) internal successors, (1787), 18 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:36,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:07:36,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 273 [2023-01-28 11:07:36,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:38,732 INFO L130 PetriNetUnfolder]: 7225/11173 cut-off events. [2023-01-28 11:07:38,732 INFO L131 PetriNetUnfolder]: For 173966/174050 co-relation queries the response was YES. [2023-01-28 11:07:38,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85400 conditions, 11173 events. 7225/11173 cut-off events. For 173966/174050 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 71364 event pairs, 474 based on Foata normal form. 342/11512 useless extension candidates. Maximal degree in co-relation 85313. Up to 3717 conditions per place. [2023-01-28 11:07:38,840 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 1311 selfloop transitions, 271 changer transitions 23/1624 dead transitions. [2023-01-28 11:07:38,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 1624 transitions, 20751 flow [2023-01-28 11:07:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-01-28 11:07:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-01-28 11:07:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2129 transitions. [2023-01-28 11:07:38,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38992673992673993 [2023-01-28 11:07:38,844 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2129 transitions. [2023-01-28 11:07:38,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2129 transitions. [2023-01-28 11:07:38,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:38,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2129 transitions. [2023-01-28 11:07:38,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 106.45) internal successors, (2129), 20 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:38,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 273.0) internal successors, (5733), 21 states have internal predecessors, (5733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:38,852 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 273.0) internal successors, (5733), 21 states have internal predecessors, (5733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:38,853 INFO L175 Difference]: Start difference. First operand has 228 places, 628 transitions, 6912 flow. Second operand 20 states and 2129 transitions. [2023-01-28 11:07:38,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 1624 transitions, 20751 flow [2023-01-28 11:07:39,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 1624 transitions, 19822 flow, removed 369 selfloop flow, removed 12 redundant places. [2023-01-28 11:07:39,337 INFO L231 Difference]: Finished difference. Result has 244 places, 818 transitions, 9562 flow [2023-01-28 11:07:39,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=6348, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=9562, PETRI_PLACES=244, PETRI_TRANSITIONS=818} [2023-01-28 11:07:39,338 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2023-01-28 11:07:39,338 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 818 transitions, 9562 flow [2023-01-28 11:07:39,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 99.27777777777777) internal successors, (1787), 18 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:39,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:39,339 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:07:39,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-28 11:07:39,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:39,544 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:07:39,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:07:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1167316142, now seen corresponding path program 8 times [2023-01-28 11:07:39,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:07:39,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011168278] [2023-01-28 11:07:39,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:39,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:07:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:39,636 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-28 11:07:39,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:07:39,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011168278] [2023-01-28 11:07:39,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011168278] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:07:39,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719386179] [2023-01-28 11:07:39,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 11:07:39,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:39,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:07:39,638 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:07:39,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-28 11:07:39,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:07:39,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:07:39,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 11:07:39,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:07:39,793 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-28 11:07:39,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:07:39,837 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-28 11:07:39,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719386179] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:07:39,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:07:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-01-28 11:07:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217826684] [2023-01-28 11:07:39,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:07:39,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 11:07:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:07:39,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 11:07:39,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-01-28 11:07:39,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 273 [2023-01-28 11:07:39,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 818 transitions, 9562 flow. Second operand has 14 states, 14 states have (on average 106.78571428571429) internal successors, (1495), 14 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:39,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:07:39,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 273 [2023-01-28 11:07:39,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:41,919 INFO L130 PetriNetUnfolder]: 5559/8981 cut-off events. [2023-01-28 11:07:41,919 INFO L131 PetriNetUnfolder]: For 176451/177618 co-relation queries the response was YES. [2023-01-28 11:07:41,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72966 conditions, 8981 events. 5559/8981 cut-off events. For 176451/177618 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 60636 event pairs, 1030 based on Foata normal form. 824/9507 useless extension candidates. Maximal degree in co-relation 72874. Up to 4599 conditions per place. [2023-01-28 11:07:42,015 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 695 selfloop transitions, 58 changer transitions 22/851 dead transitions. [2023-01-28 11:07:42,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 851 transitions, 11833 flow [2023-01-28 11:07:42,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 11:07:42,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 11:07:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 904 transitions. [2023-01-28 11:07:42,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4139194139194139 [2023-01-28 11:07:42,017 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 904 transitions. [2023-01-28 11:07:42,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 904 transitions. [2023-01-28 11:07:42,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:42,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 904 transitions. [2023-01-28 11:07:42,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:42,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:42,021 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:42,021 INFO L175 Difference]: Start difference. First operand has 244 places, 818 transitions, 9562 flow. Second operand 8 states and 904 transitions. [2023-01-28 11:07:42,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 851 transitions, 11833 flow [2023-01-28 11:07:42,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 851 transitions, 11206 flow, removed 288 selfloop flow, removed 6 redundant places. [2023-01-28 11:07:42,936 INFO L231 Difference]: Finished difference. Result has 243 places, 713 transitions, 8108 flow [2023-01-28 11:07:42,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=7863, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8108, PETRI_PLACES=243, PETRI_TRANSITIONS=713} [2023-01-28 11:07:42,936 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 213 predicate places. [2023-01-28 11:07:42,936 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 713 transitions, 8108 flow [2023-01-28 11:07:42,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 106.78571428571429) internal successors, (1495), 14 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:42,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:42,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:07:42,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-28 11:07:43,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-01-28 11:07:43,140 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:07:43,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:07:43,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1894620887, now seen corresponding path program 2 times [2023-01-28 11:07:43,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:07:43,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864683075] [2023-01-28 11:07:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:43,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:07:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:07:43,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:07:43,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864683075] [2023-01-28 11:07:43,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864683075] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:07:43,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355840521] [2023-01-28 11:07:43,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 11:07:43,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:43,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:07:43,251 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:07:43,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-28 11:07:43,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:07:43,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:07:43,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 11:07:43,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:07:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 11:07:43,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:07:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 11:07:43,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355840521] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:07:43,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:07:43,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2023-01-28 11:07:43,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796267611] [2023-01-28 11:07:43,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:07:43,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-28 11:07:43,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:07:43,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-28 11:07:43,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-01-28 11:07:43,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 273 [2023-01-28 11:07:43,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 713 transitions, 8108 flow. Second operand has 15 states, 15 states have (on average 100.6) internal successors, (1509), 15 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:43,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:07:43,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 273 [2023-01-28 11:07:43,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:45,333 INFO L130 PetriNetUnfolder]: 5039/8294 cut-off events. [2023-01-28 11:07:45,333 INFO L131 PetriNetUnfolder]: For 115324/115356 co-relation queries the response was YES. [2023-01-28 11:07:45,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61507 conditions, 8294 events. 5039/8294 cut-off events. For 115324/115356 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 55594 event pairs, 681 based on Foata normal form. 468/8741 useless extension candidates. Maximal degree in co-relation 61414. Up to 3710 conditions per place. [2023-01-28 11:07:45,409 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 710 selfloop transitions, 54 changer transitions 41/825 dead transitions. [2023-01-28 11:07:45,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 825 transitions, 10653 flow [2023-01-28 11:07:45,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 11:07:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 11:07:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 954 transitions. [2023-01-28 11:07:45,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3882783882783883 [2023-01-28 11:07:45,412 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 954 transitions. [2023-01-28 11:07:45,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 954 transitions. [2023-01-28 11:07:45,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:45,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 954 transitions. [2023-01-28 11:07:45,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.0) internal successors, (954), 9 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:45,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:45,416 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:45,416 INFO L175 Difference]: Start difference. First operand has 243 places, 713 transitions, 8108 flow. Second operand 9 states and 954 transitions. [2023-01-28 11:07:45,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 825 transitions, 10653 flow [2023-01-28 11:07:45,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 825 transitions, 10560 flow, removed 44 selfloop flow, removed 5 redundant places. [2023-01-28 11:07:45,876 INFO L231 Difference]: Finished difference. Result has 240 places, 571 transitions, 6523 flow [2023-01-28 11:07:45,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=6786, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6523, PETRI_PLACES=240, PETRI_TRANSITIONS=571} [2023-01-28 11:07:45,877 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 210 predicate places. [2023-01-28 11:07:45,877 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 571 transitions, 6523 flow [2023-01-28 11:07:45,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 100.6) internal successors, (1509), 15 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:45,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:45,878 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:07:45,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-28 11:07:46,083 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,SelfDestructingSolverStorable12 [2023-01-28 11:07:46,083 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:07:46,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:07:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash -723434204, now seen corresponding path program 9 times [2023-01-28 11:07:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:07:46,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18493289] [2023-01-28 11:07:46,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:46,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:07:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:46,273 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-28 11:07:46,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:07:46,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18493289] [2023-01-28 11:07:46,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18493289] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:07:46,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658485907] [2023-01-28 11:07:46,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 11:07:46,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:46,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:07:46,275 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:07:46,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-28 11:07:46,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 11:07:46,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:07:46,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 13 conjunts are in the unsatisfiable core [2023-01-28 11:07:46,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:07:46,572 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-28 11:07:46,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:07:46,636 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-28 11:07:46,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658485907] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:07:46,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:07:46,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-01-28 11:07:46,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630057601] [2023-01-28 11:07:46,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:07:46,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 11:07:46,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:07:46,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 11:07:46,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-01-28 11:07:46,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 273 [2023-01-28 11:07:46,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 571 transitions, 6523 flow. Second operand has 14 states, 14 states have (on average 103.14285714285714) internal successors, (1444), 14 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:46,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:07:46,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 273 [2023-01-28 11:07:46,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:47,792 INFO L130 PetriNetUnfolder]: 3389/5721 cut-off events. [2023-01-28 11:07:47,792 INFO L131 PetriNetUnfolder]: For 85863/86141 co-relation queries the response was YES. [2023-01-28 11:07:47,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43217 conditions, 5721 events. 3389/5721 cut-off events. For 85863/86141 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 38110 event pairs, 607 based on Foata normal form. 439/6072 useless extension candidates. Maximal degree in co-relation 43126. Up to 2471 conditions per place. [2023-01-28 11:07:47,826 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 367 selfloop transitions, 28 changer transitions 181/596 dead transitions. [2023-01-28 11:07:47,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 596 transitions, 7766 flow [2023-01-28 11:07:47,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 11:07:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 11:07:47,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 868 transitions. [2023-01-28 11:07:47,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2023-01-28 11:07:47,828 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 868 transitions. [2023-01-28 11:07:47,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 868 transitions. [2023-01-28 11:07:47,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:47,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 868 transitions. [2023-01-28 11:07:47,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.5) internal successors, (868), 8 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:47,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:47,831 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:47,831 INFO L175 Difference]: Start difference. First operand has 240 places, 571 transitions, 6523 flow. Second operand 8 states and 868 transitions. [2023-01-28 11:07:47,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 596 transitions, 7766 flow [2023-01-28 11:07:48,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 596 transitions, 7462 flow, removed 113 selfloop flow, removed 8 redundant places. [2023-01-28 11:07:48,065 INFO L231 Difference]: Finished difference. Result has 238 places, 381 transitions, 3735 flow [2023-01-28 11:07:48,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=5749, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3735, PETRI_PLACES=238, PETRI_TRANSITIONS=381} [2023-01-28 11:07:48,065 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places. [2023-01-28 11:07:48,065 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 381 transitions, 3735 flow [2023-01-28 11:07:48,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 103.14285714285714) internal successors, (1444), 14 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:48,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:48,066 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:07:48,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-28 11:07:48,267 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,SelfDestructingSolverStorable13 [2023-01-28 11:07:48,267 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:07:48,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:07:48,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1684732658, now seen corresponding path program 10 times [2023-01-28 11:07:48,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:07:48,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309107572] [2023-01-28 11:07:48,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:48,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:07:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:07:48,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:07:48,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309107572] [2023-01-28 11:07:48,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309107572] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:07:48,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778525580] [2023-01-28 11:07:48,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 11:07:48,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:48,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:07:48,353 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:07:48,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-28 11:07:48,476 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 11:07:48,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:07:48,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 11:07:48,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:07:48,547 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-28 11:07:48,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:07:48,608 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-28 11:07:48,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778525580] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:07:48,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:07:48,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-01-28 11:07:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554952015] [2023-01-28 11:07:48,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:07:48,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 11:07:48,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:07:48,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 11:07:48,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-01-28 11:07:48,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 273 [2023-01-28 11:07:48,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 381 transitions, 3735 flow. Second operand has 14 states, 14 states have (on average 106.57142857142857) internal successors, (1492), 14 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:48,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:07:48,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 273 [2023-01-28 11:07:48,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:48,937 INFO L130 PetriNetUnfolder]: 1412/2066 cut-off events. [2023-01-28 11:07:48,937 INFO L131 PetriNetUnfolder]: For 30437/30637 co-relation queries the response was YES. [2023-01-28 11:07:48,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16123 conditions, 2066 events. 1412/2066 cut-off events. For 30437/30637 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9088 event pairs, 152 based on Foata normal form. 213/2178 useless extension candidates. Maximal degree in co-relation 16049. Up to 769 conditions per place. [2023-01-28 11:07:49,015 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 211 selfloop transitions, 101 changer transitions 0/339 dead transitions. [2023-01-28 11:07:49,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 339 transitions, 4204 flow [2023-01-28 11:07:49,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 11:07:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 11:07:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 773 transitions. [2023-01-28 11:07:49,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4045002616431188 [2023-01-28 11:07:49,017 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 773 transitions. [2023-01-28 11:07:49,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 773 transitions. [2023-01-28 11:07:49,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:49,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 773 transitions. [2023-01-28 11:07:49,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:49,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:49,020 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:49,020 INFO L175 Difference]: Start difference. First operand has 238 places, 381 transitions, 3735 flow. Second operand 7 states and 773 transitions. [2023-01-28 11:07:49,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 339 transitions, 4204 flow [2023-01-28 11:07:49,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 339 transitions, 3565 flow, removed 198 selfloop flow, removed 38 redundant places. [2023-01-28 11:07:49,080 INFO L231 Difference]: Finished difference. Result has 144 places, 297 transitions, 2795 flow [2023-01-28 11:07:49,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=2458, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2795, PETRI_PLACES=144, PETRI_TRANSITIONS=297} [2023-01-28 11:07:49,080 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 114 predicate places. [2023-01-28 11:07:49,080 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 297 transitions, 2795 flow [2023-01-28 11:07:49,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 106.57142857142857) internal successors, (1492), 14 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:49,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:49,081 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-28 11:07:49,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-01-28 11:07:49,289 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,SelfDestructingSolverStorable14 [2023-01-28 11:07:49,289 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:07:49,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:07:49,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1237475583, now seen corresponding path program 11 times [2023-01-28 11:07:49,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:07:49,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77435421] [2023-01-28 11:07:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:49,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:07:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:49,438 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-28 11:07:49,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:07:49,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77435421] [2023-01-28 11:07:49,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77435421] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:07:49,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692923457] [2023-01-28 11:07:49,439 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 11:07:49,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:49,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:07:49,440 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-28 11:07:49,443 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-28 11:07:49,546 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:07:49,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:07:49,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 11:07:49,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:07:49,662 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-28 11:07:49,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:07:49,753 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-28 11:07:49,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692923457] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:07:49,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:07:49,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-01-28 11:07:49,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938234117] [2023-01-28 11:07:49,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:07:49,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-28 11:07:49,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:07:49,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-28 11:07:49,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-01-28 11:07:49,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 273 [2023-01-28 11:07:49,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 297 transitions, 2795 flow. Second operand has 18 states, 18 states have (on average 96.27777777777777) internal successors, (1733), 18 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:49,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:07:49,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 273 [2023-01-28 11:07:49,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:50,599 INFO L130 PetriNetUnfolder]: 1612/2350 cut-off events. [2023-01-28 11:07:50,599 INFO L131 PetriNetUnfolder]: For 18963/18963 co-relation queries the response was YES. [2023-01-28 11:07:50,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16313 conditions, 2350 events. 1612/2350 cut-off events. For 18963/18963 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 10094 event pairs, 98 based on Foata normal form. 20/2370 useless extension candidates. Maximal degree in co-relation 16269. Up to 1058 conditions per place. [2023-01-28 11:07:50,616 INFO L137 encePairwiseOnDemand]: 263/273 looper letters, 273 selfloop transitions, 180 changer transitions 0/453 dead transitions. [2023-01-28 11:07:50,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 453 transitions, 5329 flow [2023-01-28 11:07:50,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-01-28 11:07:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-01-28 11:07:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1907 transitions. [2023-01-28 11:07:50,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3676498939656834 [2023-01-28 11:07:50,620 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1907 transitions. [2023-01-28 11:07:50,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1907 transitions. [2023-01-28 11:07:50,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:50,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1907 transitions. [2023-01-28 11:07:50,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 100.36842105263158) internal successors, (1907), 19 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:50,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 273.0) internal successors, (5460), 20 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:50,627 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 273.0) internal successors, (5460), 20 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:50,627 INFO L175 Difference]: Start difference. First operand has 144 places, 297 transitions, 2795 flow. Second operand 19 states and 1907 transitions. [2023-01-28 11:07:50,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 453 transitions, 5329 flow [2023-01-28 11:07:50,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 453 transitions, 4926 flow, removed 85 selfloop flow, removed 10 redundant places. [2023-01-28 11:07:50,685 INFO L231 Difference]: Finished difference. Result has 159 places, 344 transitions, 3526 flow [2023-01-28 11:07:50,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=2557, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3526, PETRI_PLACES=159, PETRI_TRANSITIONS=344} [2023-01-28 11:07:50,686 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2023-01-28 11:07:50,686 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 344 transitions, 3526 flow [2023-01-28 11:07:50,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 96.27777777777777) internal successors, (1733), 18 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:50,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:50,687 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-28 11:07:50,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-01-28 11:07:50,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:50,892 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-28 11:07:50,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:07:50,893 INFO L85 PathProgramCache]: Analyzing trace with hash -116924017, now seen corresponding path program 12 times [2023-01-28 11:07:50,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:07:50,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770334774] [2023-01-28 11:07:50,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:50,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:07:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:51,040 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-28 11:07:51,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:07:51,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770334774] [2023-01-28 11:07:51,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770334774] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:07:51,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331194886] [2023-01-28 11:07:51,041 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 11:07:51,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:51,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:07:51,045 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-28 11:07:51,072 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-28 11:07:51,199 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-28 11:07:51,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:07:51,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-28 11:07:51,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:07:51,321 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-28 11:07:51,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:07:51,448 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-28 11:07:51,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331194886] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:07:51,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:07:51,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-01-28 11:07:51,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023610265] [2023-01-28 11:07:51,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:07:51,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-28 11:07:51,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:07:51,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-28 11:07:51,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-01-28 11:07:51,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 273 [2023-01-28 11:07:51,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 344 transitions, 3526 flow. Second operand has 21 states, 21 states have (on average 98.95238095238095) internal successors, (2078), 21 states have internal predecessors, (2078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:51,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:07:51,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 273 [2023-01-28 11:07:51,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:52,210 INFO L130 PetriNetUnfolder]: 2215/3291 cut-off events. [2023-01-28 11:07:52,210 INFO L131 PetriNetUnfolder]: For 26176/26217 co-relation queries the response was YES. [2023-01-28 11:07:52,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22601 conditions, 3291 events. 2215/3291 cut-off events. For 26176/26217 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 15748 event pairs, 289 based on Foata normal form. 44/3320 useless extension candidates. Maximal degree in co-relation 22555. Up to 1539 conditions per place. [2023-01-28 11:07:52,234 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 414 selfloop transitions, 171 changer transitions 0/601 dead transitions. [2023-01-28 11:07:52,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 601 transitions, 7138 flow [2023-01-28 11:07:52,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 11:07:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 11:07:52,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1473 transitions. [2023-01-28 11:07:52,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38540031397174257 [2023-01-28 11:07:52,237 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1473 transitions. [2023-01-28 11:07:52,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1473 transitions. [2023-01-28 11:07:52,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:52,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1473 transitions. [2023-01-28 11:07:52,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 105.21428571428571) internal successors, (1473), 14 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:52,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 273.0) internal successors, (4095), 15 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:52,242 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 273.0) internal successors, (4095), 15 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:52,242 INFO L175 Difference]: Start difference. First operand has 159 places, 344 transitions, 3526 flow. Second operand 14 states and 1473 transitions. [2023-01-28 11:07:52,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 601 transitions, 7138 flow [2023-01-28 11:07:52,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 601 transitions, 6858 flow, removed 30 selfloop flow, removed 6 redundant places. [2023-01-28 11:07:52,336 INFO L231 Difference]: Finished difference. Result has 172 places, 429 transitions, 4881 flow [2023-01-28 11:07:52,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=3302, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4881, PETRI_PLACES=172, PETRI_TRANSITIONS=429} [2023-01-28 11:07:52,337 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2023-01-28 11:07:52,337 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 429 transitions, 4881 flow [2023-01-28 11:07:52,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 98.95238095238095) internal successors, (2078), 21 states have internal predecessors, (2078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:52,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:52,338 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-28 11:07:52,345 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-28 11:07:52,543 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,SelfDestructingSolverStorable16 [2023-01-28 11:07:52,543 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-28 11:07:52,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:07:52,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1665899523, now seen corresponding path program 13 times [2023-01-28 11:07:52,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:07:52,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419161418] [2023-01-28 11:07:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:52,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:07:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:52,648 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-28 11:07:52,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:07:52,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419161418] [2023-01-28 11:07:52,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419161418] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:07:52,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015666163] [2023-01-28 11:07:52,648 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 11:07:52,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:52,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:07:52,653 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-28 11:07:52,656 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-28 11:07:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:52,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-28 11:07:52,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:07:52,886 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-28 11:07:52,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:07:53,000 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-28 11:07:53,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015666163] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:07:53,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:07:53,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-01-28 11:07:53,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676830469] [2023-01-28 11:07:53,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:07:53,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-28 11:07:53,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:07:53,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-28 11:07:53,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-01-28 11:07:53,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 273 [2023-01-28 11:07:53,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 429 transitions, 4881 flow. Second operand has 20 states, 20 states have (on average 99.1) internal successors, (1982), 20 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:53,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:07:53,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 273 [2023-01-28 11:07:53,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:54,025 INFO L130 PetriNetUnfolder]: 3021/4485 cut-off events. [2023-01-28 11:07:54,025 INFO L131 PetriNetUnfolder]: For 42902/42941 co-relation queries the response was YES. [2023-01-28 11:07:54,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33996 conditions, 4485 events. 3021/4485 cut-off events. For 42902/42941 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 22292 event pairs, 346 based on Foata normal form. 51/4530 useless extension candidates. Maximal degree in co-relation 33944. Up to 1808 conditions per place. [2023-01-28 11:07:54,055 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 425 selfloop transitions, 258 changer transitions 0/699 dead transitions. [2023-01-28 11:07:54,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 699 transitions, 8996 flow [2023-01-28 11:07:54,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-28 11:07:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-01-28 11:07:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1898 transitions. [2023-01-28 11:07:54,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3862433862433862 [2023-01-28 11:07:54,057 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1898 transitions. [2023-01-28 11:07:54,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1898 transitions. [2023-01-28 11:07:54,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:54,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1898 transitions. [2023-01-28 11:07:54,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 105.44444444444444) internal successors, (1898), 18 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:54,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 273.0) internal successors, (5187), 19 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:54,063 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 273.0) internal successors, (5187), 19 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:54,063 INFO L175 Difference]: Start difference. First operand has 172 places, 429 transitions, 4881 flow. Second operand 18 states and 1898 transitions. [2023-01-28 11:07:54,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 699 transitions, 8996 flow [2023-01-28 11:07:54,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 699 transitions, 8785 flow, removed 103 selfloop flow, removed 3 redundant places. [2023-01-28 11:07:54,222 INFO L231 Difference]: Finished difference. Result has 193 places, 490 transitions, 6403 flow [2023-01-28 11:07:54,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=4690, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6403, PETRI_PLACES=193, PETRI_TRANSITIONS=490} [2023-01-28 11:07:54,223 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 163 predicate places. [2023-01-28 11:07:54,223 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 490 transitions, 6403 flow [2023-01-28 11:07:54,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 99.1) internal successors, (1982), 20 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:54,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:54,223 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-28 11:07:54,229 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-28 11:07:54,423 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,SelfDestructingSolverStorable17 [2023-01-28 11:07:54,424 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-28 11:07:54,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:07:54,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1130806537, now seen corresponding path program 14 times [2023-01-28 11:07:54,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:07:54,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510662480] [2023-01-28 11:07:54,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:54,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:07:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:54,572 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-28 11:07:54,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:07:54,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510662480] [2023-01-28 11:07:54,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510662480] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:07:54,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541626486] [2023-01-28 11:07:54,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 11:07:54,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:54,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:07:54,576 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-28 11:07:54,579 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-28 11:07:54,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:07:54,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:07:54,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-28 11:07:54,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:07:54,811 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-28 11:07:54,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:07:54,890 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-28 11:07:54,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541626486] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:07:54,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:07:54,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2023-01-28 11:07:54,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084742067] [2023-01-28 11:07:54,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:07:54,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-01-28 11:07:54,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:07:54,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-01-28 11:07:54,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-01-28 11:07:54,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 273 [2023-01-28 11:07:54,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 490 transitions, 6403 flow. Second operand has 19 states, 19 states have (on average 99.15789473684211) internal successors, (1884), 19 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:54,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:07:54,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 273 [2023-01-28 11:07:54,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:55,803 INFO L130 PetriNetUnfolder]: 3013/4472 cut-off events. [2023-01-28 11:07:55,803 INFO L131 PetriNetUnfolder]: For 46231/46274 co-relation queries the response was YES. [2023-01-28 11:07:55,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35330 conditions, 4472 events. 3013/4472 cut-off events. For 46231/46274 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 22207 event pairs, 537 based on Foata normal form. 56/4514 useless extension candidates. Maximal degree in co-relation 35271. Up to 2574 conditions per place. [2023-01-28 11:07:55,842 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 468 selfloop transitions, 119 changer transitions 0/602 dead transitions. [2023-01-28 11:07:55,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 602 transitions, 8715 flow [2023-01-28 11:07:55,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 11:07:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 11:07:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 941 transitions. [2023-01-28 11:07:55,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.382987382987383 [2023-01-28 11:07:55,844 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 941 transitions. [2023-01-28 11:07:55,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 941 transitions. [2023-01-28 11:07:55,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:55,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 941 transitions. [2023-01-28 11:07:55,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.55555555555556) internal successors, (941), 9 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:55,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:55,847 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:55,847 INFO L175 Difference]: Start difference. First operand has 193 places, 490 transitions, 6403 flow. Second operand 9 states and 941 transitions. [2023-01-28 11:07:55,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 602 transitions, 8715 flow [2023-01-28 11:07:56,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 602 transitions, 8346 flow, removed 162 selfloop flow, removed 5 redundant places. [2023-01-28 11:07:56,049 INFO L231 Difference]: Finished difference. Result has 198 places, 491 transitions, 6525 flow [2023-01-28 11:07:56,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=5975, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6525, PETRI_PLACES=198, PETRI_TRANSITIONS=491} [2023-01-28 11:07:56,050 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 168 predicate places. [2023-01-28 11:07:56,050 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 491 transitions, 6525 flow [2023-01-28 11:07:56,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 99.15789473684211) internal successors, (1884), 19 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:56,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:56,051 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-28 11:07:56,055 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-28 11:07:56,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:56,251 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-28 11:07:56,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:07:56,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1249787287, now seen corresponding path program 15 times [2023-01-28 11:07:56,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:07:56,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694546996] [2023-01-28 11:07:56,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:56,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:07:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:56,394 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-28 11:07:56,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:07:56,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694546996] [2023-01-28 11:07:56,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694546996] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:07:56,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974733348] [2023-01-28 11:07:56,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 11:07:56,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:07:56,397 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-28 11:07:56,421 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-28 11:07:56,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 11:07:56,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:07:56,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-28 11:07:56,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:07:56,617 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-28 11:07:56,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:07:56,699 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-28 11:07:56,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974733348] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:07:56,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:07:56,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-01-28 11:07:56,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974943750] [2023-01-28 11:07:56,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:07:56,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-28 11:07:56,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:07:56,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-28 11:07:56,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-01-28 11:07:56,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 273 [2023-01-28 11:07:56,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 491 transitions, 6525 flow. Second operand has 20 states, 20 states have (on average 98.9) internal successors, (1978), 20 states have internal predecessors, (1978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:56,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:07:56,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 273 [2023-01-28 11:07:56,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:57,584 INFO L130 PetriNetUnfolder]: 2975/4394 cut-off events. [2023-01-28 11:07:57,584 INFO L131 PetriNetUnfolder]: For 47127/47164 co-relation queries the response was YES. [2023-01-28 11:07:57,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34952 conditions, 4394 events. 2975/4394 cut-off events. For 47127/47164 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 21552 event pairs, 552 based on Foata normal form. 48/4428 useless extension candidates. Maximal degree in co-relation 34889. Up to 2574 conditions per place. [2023-01-28 11:07:57,623 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 430 selfloop transitions, 131 changer transitions 0/576 dead transitions. [2023-01-28 11:07:57,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 576 transitions, 8410 flow [2023-01-28 11:07:57,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 11:07:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 11:07:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 941 transitions. [2023-01-28 11:07:57,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.382987382987383 [2023-01-28 11:07:57,625 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 941 transitions. [2023-01-28 11:07:57,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 941 transitions. [2023-01-28 11:07:57,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:57,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 941 transitions. [2023-01-28 11:07:57,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.55555555555556) internal successors, (941), 9 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:57,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:57,628 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:57,628 INFO L175 Difference]: Start difference. First operand has 198 places, 491 transitions, 6525 flow. Second operand 9 states and 941 transitions. [2023-01-28 11:07:57,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 576 transitions, 8410 flow [2023-01-28 11:07:57,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 576 transitions, 8266 flow, removed 34 selfloop flow, removed 4 redundant places. [2023-01-28 11:07:57,818 INFO L231 Difference]: Finished difference. Result has 202 places, 489 transitions, 6618 flow [2023-01-28 11:07:57,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=6240, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6618, PETRI_PLACES=202, PETRI_TRANSITIONS=489} [2023-01-28 11:07:57,818 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 172 predicate places. [2023-01-28 11:07:57,818 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 489 transitions, 6618 flow [2023-01-28 11:07:57,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 98.9) internal successors, (1978), 20 states have internal predecessors, (1978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:57,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:57,819 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-28 11:07:57,824 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-28 11:07:58,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:58,022 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-28 11:07:58,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:07:58,022 INFO L85 PathProgramCache]: Analyzing trace with hash 333717559, now seen corresponding path program 16 times [2023-01-28 11:07:58,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:07:58,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785977358] [2023-01-28 11:07:58,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:07:58,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:07:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:07:58,157 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-28 11:07:58,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:07:58,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785977358] [2023-01-28 11:07:58,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785977358] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:07:58,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284595825] [2023-01-28 11:07:58,157 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 11:07:58,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:07:58,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:07:58,159 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-28 11:07:58,163 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-28 11:07:58,256 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 11:07:58,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:07:58,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 11:07:58,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:07:58,356 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-28 11:07:58,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:07:58,452 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-28 11:07:58,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284595825] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:07:58,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:07:58,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2023-01-28 11:07:58,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060355601] [2023-01-28 11:07:58,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:07:58,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-28 11:07:58,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:07:58,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-28 11:07:58,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-01-28 11:07:58,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 273 [2023-01-28 11:07:58,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 489 transitions, 6618 flow. Second operand has 20 states, 20 states have (on average 96.05) internal successors, (1921), 20 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:58,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:07:58,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 273 [2023-01-28 11:07:58,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:07:59,689 INFO L130 PetriNetUnfolder]: 3040/4448 cut-off events. [2023-01-28 11:07:59,689 INFO L131 PetriNetUnfolder]: For 46701/46701 co-relation queries the response was YES. [2023-01-28 11:07:59,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35363 conditions, 4448 events. 3040/4448 cut-off events. For 46701/46701 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 21239 event pairs, 243 based on Foata normal form. 28/4476 useless extension candidates. Maximal degree in co-relation 35299. Up to 1770 conditions per place. [2023-01-28 11:07:59,730 INFO L137 encePairwiseOnDemand]: 263/273 looper letters, 438 selfloop transitions, 279 changer transitions 0/717 dead transitions. [2023-01-28 11:07:59,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 717 transitions, 10865 flow [2023-01-28 11:07:59,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-28 11:07:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-01-28 11:07:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2229 transitions. [2023-01-28 11:07:59,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3711288711288711 [2023-01-28 11:07:59,733 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2229 transitions. [2023-01-28 11:07:59,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2229 transitions. [2023-01-28 11:07:59,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:07:59,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2229 transitions. [2023-01-28 11:07:59,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 101.31818181818181) internal successors, (2229), 22 states have internal predecessors, (2229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:59,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 273.0) internal successors, (6279), 23 states have internal predecessors, (6279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:59,741 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 273.0) internal successors, (6279), 23 states have internal predecessors, (6279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:59,741 INFO L175 Difference]: Start difference. First operand has 202 places, 489 transitions, 6618 flow. Second operand 22 states and 2229 transitions. [2023-01-28 11:07:59,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 717 transitions, 10865 flow [2023-01-28 11:07:59,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 717 transitions, 10697 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-01-28 11:07:59,954 INFO L231 Difference]: Finished difference. Result has 216 places, 526 transitions, 7495 flow [2023-01-28 11:07:59,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=6450, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=241, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7495, PETRI_PLACES=216, PETRI_TRANSITIONS=526} [2023-01-28 11:07:59,955 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 186 predicate places. [2023-01-28 11:07:59,955 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 526 transitions, 7495 flow [2023-01-28 11:07:59,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 96.05) internal successors, (1921), 20 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:07:59,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:07:59,955 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-28 11:07:59,959 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-28 11:08:00,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:08:00,156 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-28 11:08:00,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:08:00,156 INFO L85 PathProgramCache]: Analyzing trace with hash -269231513, now seen corresponding path program 17 times [2023-01-28 11:08:00,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:08:00,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864193670] [2023-01-28 11:08:00,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:08:00,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:08:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:08:00,262 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-28 11:08:00,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:08:00,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864193670] [2023-01-28 11:08:00,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864193670] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:08:00,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705547255] [2023-01-28 11:08:00,262 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 11:08:00,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:08:00,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:08:00,263 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-28 11:08:00,265 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-28 11:08:00,370 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:08:00,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:08:00,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 11:08:00,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:08:00,434 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-28 11:08:00,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:08:00,515 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-28 11:08:00,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705547255] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:08:00,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:08:00,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2023-01-28 11:08:00,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137089645] [2023-01-28 11:08:00,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:08:00,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-01-28 11:08:00,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:08:00,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-01-28 11:08:00,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-01-28 11:08:00,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 273 [2023-01-28 11:08:00,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 526 transitions, 7495 flow. Second operand has 17 states, 17 states have (on average 96.70588235294117) internal successors, (1644), 17 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:00,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:08:00,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 273 [2023-01-28 11:08:00,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:08:01,715 INFO L130 PetriNetUnfolder]: 3012/4420 cut-off events. [2023-01-28 11:08:01,715 INFO L131 PetriNetUnfolder]: For 49077/49077 co-relation queries the response was YES. [2023-01-28 11:08:01,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35892 conditions, 4420 events. 3012/4420 cut-off events. For 49077/49077 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 21233 event pairs, 168 based on Foata normal form. 28/4448 useless extension candidates. Maximal degree in co-relation 35828. Up to 1770 conditions per place. [2023-01-28 11:08:01,754 INFO L137 encePairwiseOnDemand]: 263/273 looper letters, 376 selfloop transitions, 360 changer transitions 0/736 dead transitions. [2023-01-28 11:08:01,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 736 transitions, 11616 flow [2023-01-28 11:08:01,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-01-28 11:08:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-01-28 11:08:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1921 transitions. [2023-01-28 11:08:01,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37034894929631773 [2023-01-28 11:08:01,757 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1921 transitions. [2023-01-28 11:08:01,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1921 transitions. [2023-01-28 11:08:01,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:08:01,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1921 transitions. [2023-01-28 11:08:01,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 101.10526315789474) internal successors, (1921), 19 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:01,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 273.0) internal successors, (5460), 20 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:01,762 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 273.0) internal successors, (5460), 20 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:01,762 INFO L175 Difference]: Start difference. First operand has 216 places, 526 transitions, 7495 flow. Second operand 19 states and 1921 transitions. [2023-01-28 11:08:01,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 736 transitions, 11616 flow [2023-01-28 11:08:01,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 736 transitions, 11523 flow, removed 23 selfloop flow, removed 6 redundant places. [2023-01-28 11:08:01,977 INFO L231 Difference]: Finished difference. Result has 234 places, 580 transitions, 9271 flow [2023-01-28 11:08:01,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=7387, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=305, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=9271, PETRI_PLACES=234, PETRI_TRANSITIONS=580} [2023-01-28 11:08:01,978 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places. [2023-01-28 11:08:01,978 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 580 transitions, 9271 flow [2023-01-28 11:08:01,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 96.70588235294117) internal successors, (1644), 17 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:01,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:08:01,979 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-28 11:08:01,984 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-28 11:08:02,184 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,SelfDestructingSolverStorable21 [2023-01-28 11:08:02,184 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-28 11:08:02,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:08:02,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1516768679, now seen corresponding path program 18 times [2023-01-28 11:08:02,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:08:02,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979961289] [2023-01-28 11:08:02,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:08:02,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:08:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:08:02,305 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-28 11:08:02,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:08:02,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979961289] [2023-01-28 11:08:02,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979961289] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:08:02,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966839274] [2023-01-28 11:08:02,305 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 11:08:02,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:08:02,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:08:02,307 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-28 11:08:02,308 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-28 11:08:02,411 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-28 11:08:02,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:08:02,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-28 11:08:02,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:08:02,506 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-28 11:08:02,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:08:02,619 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-28 11:08:02,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966839274] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:08:02,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:08:02,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-01-28 11:08:02,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930126059] [2023-01-28 11:08:02,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:08:02,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-28 11:08:02,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:08:02,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-28 11:08:02,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-01-28 11:08:02,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 273 [2023-01-28 11:08:02,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 580 transitions, 9271 flow. Second operand has 21 states, 21 states have (on average 98.85714285714286) internal successors, (2076), 21 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:02,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:08:02,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 273 [2023-01-28 11:08:02,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:08:03,676 INFO L130 PetriNetUnfolder]: 3249/4799 cut-off events. [2023-01-28 11:08:03,676 INFO L131 PetriNetUnfolder]: For 63242/63263 co-relation queries the response was YES. [2023-01-28 11:08:03,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41201 conditions, 4799 events. 3249/4799 cut-off events. For 63242/63263 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 23780 event pairs, 701 based on Foata normal form. 36/4824 useless extension candidates. Maximal degree in co-relation 41131. Up to 3456 conditions per place. [2023-01-28 11:08:03,711 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 498 selfloop transitions, 197 changer transitions 0/721 dead transitions. [2023-01-28 11:08:03,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 721 transitions, 12395 flow [2023-01-28 11:08:03,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-28 11:08:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-28 11:08:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1154 transitions. [2023-01-28 11:08:03,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38428238428238426 [2023-01-28 11:08:03,713 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1154 transitions. [2023-01-28 11:08:03,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1154 transitions. [2023-01-28 11:08:03,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:08:03,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1154 transitions. [2023-01-28 11:08:03,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 104.9090909090909) internal successors, (1154), 11 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:03,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 273.0) internal successors, (3276), 12 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:03,717 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 273.0) internal successors, (3276), 12 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:03,717 INFO L175 Difference]: Start difference. First operand has 234 places, 580 transitions, 9271 flow. Second operand 11 states and 1154 transitions. [2023-01-28 11:08:03,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 721 transitions, 12395 flow [2023-01-28 11:08:03,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 721 transitions, 11919 flow, removed 71 selfloop flow, removed 7 redundant places. [2023-01-28 11:08:03,979 INFO L231 Difference]: Finished difference. Result has 240 places, 616 transitions, 10017 flow [2023-01-28 11:08:03,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=8861, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10017, PETRI_PLACES=240, PETRI_TRANSITIONS=616} [2023-01-28 11:08:03,979 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 210 predicate places. [2023-01-28 11:08:03,980 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 616 transitions, 10017 flow [2023-01-28 11:08:03,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 98.85714285714286) internal successors, (2076), 21 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:03,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:08:03,980 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-28 11:08:03,985 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-28 11:08:04,185 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,SelfDestructingSolverStorable22 [2023-01-28 11:08:04,185 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:08:04,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:08:04,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1718788835, now seen corresponding path program 19 times [2023-01-28 11:08:04,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:08:04,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281159428] [2023-01-28 11:08:04,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:08:04,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:08:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:08:04,292 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-28 11:08:04,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:08:04,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281159428] [2023-01-28 11:08:04,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281159428] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:08:04,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806301430] [2023-01-28 11:08:04,293 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 11:08:04,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:08:04,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:08:04,295 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-28 11:08:04,295 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-28 11:08:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:08:04,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-28 11:08:04,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:08:04,482 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-28 11:08:04,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:08:04,582 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-28 11:08:04,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806301430] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:08:04,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:08:04,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-01-28 11:08:04,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901667660] [2023-01-28 11:08:04,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:08:04,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-28 11:08:04,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:08:04,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-28 11:08:04,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-01-28 11:08:04,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 273 [2023-01-28 11:08:04,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 616 transitions, 10017 flow. Second operand has 21 states, 21 states have (on average 98.95238095238095) internal successors, (2078), 21 states have internal predecessors, (2078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:04,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:08:04,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 273 [2023-01-28 11:08:04,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:08:05,658 INFO L130 PetriNetUnfolder]: 3211/4725 cut-off events. [2023-01-28 11:08:05,658 INFO L131 PetriNetUnfolder]: For 61504/61537 co-relation queries the response was YES. [2023-01-28 11:08:05,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40527 conditions, 4725 events. 3211/4725 cut-off events. For 61504/61537 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 23238 event pairs, 346 based on Foata normal form. 34/4746 useless extension candidates. Maximal degree in co-relation 40454. Up to 1982 conditions per place. [2023-01-28 11:08:05,696 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 413 selfloop transitions, 323 changer transitions 0/762 dead transitions. [2023-01-28 11:08:05,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 762 transitions, 12765 flow [2023-01-28 11:08:05,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-28 11:08:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-01-28 11:08:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1583 transitions. [2023-01-28 11:08:05,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3865689865689866 [2023-01-28 11:08:05,698 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1583 transitions. [2023-01-28 11:08:05,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1583 transitions. [2023-01-28 11:08:05,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:08:05,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1583 transitions. [2023-01-28 11:08:05,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 105.53333333333333) internal successors, (1583), 15 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:05,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 273.0) internal successors, (4368), 16 states have internal predecessors, (4368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:05,702 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 273.0) internal successors, (4368), 16 states have internal predecessors, (4368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:05,702 INFO L175 Difference]: Start difference. First operand has 240 places, 616 transitions, 10017 flow. Second operand 15 states and 1583 transitions. [2023-01-28 11:08:05,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 762 transitions, 12765 flow [2023-01-28 11:08:05,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 762 transitions, 12435 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-01-28 11:08:05,980 INFO L231 Difference]: Finished difference. Result has 246 places, 615 transitions, 10313 flow [2023-01-28 11:08:05,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=9667, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=323, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=10313, PETRI_PLACES=246, PETRI_TRANSITIONS=615} [2023-01-28 11:08:05,980 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places. [2023-01-28 11:08:05,980 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 615 transitions, 10313 flow [2023-01-28 11:08:05,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 98.95238095238095) internal successors, (2078), 21 states have internal predecessors, (2078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:05,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:08:05,981 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-28 11:08:05,985 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-28 11:08:06,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:08:06,181 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:08:06,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:08:06,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2028378021, now seen corresponding path program 3 times [2023-01-28 11:08:06,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:08:06,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099463175] [2023-01-28 11:08:06,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:08:06,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:08:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:08:07,434 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-28 11:08:07,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:08:07,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099463175] [2023-01-28 11:08:07,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099463175] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:08:07,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188068781] [2023-01-28 11:08:07,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 11:08:07,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:08:07,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:08:07,436 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:08:07,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-01-28 11:08:07,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 11:08:07,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:08:07,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 57 conjunts are in the unsatisfiable core [2023-01-28 11:08:07,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:08:07,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 11:08:07,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 11:08:08,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:08:08,072 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-28 11:08:08,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:08:08,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2023-01-28 11:08:09,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:08:09,262 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-28 11:08:09,656 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-28 11:08:09,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:08:10,453 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1108 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (= c_~min1~0 .cse0) (<= c_~min2~0 .cse0) (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0) (< (select .cse1 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))) .cse0))))))) (forall ((v_ArrVal_1108 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (or (< (select .cse2 c_~A~0.offset) c_~min2~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse3 (select .cse2 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))))) (or (<= c_~min2~0 .cse3) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (= c_~min1~0 .cse3) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_1108 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (< (select .cse4 c_~A~0.offset) c_~min2~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0) (< (select .cse4 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))) c_~min2~0))))) (forall ((v_ArrVal_1108 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (let ((.cse6 (select .cse7 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse5 (select .cse7 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (= c_~min1~0 .cse5) (<= .cse6 .cse5) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0)))) (<= c_~min2~0 .cse6)))))) is different from false [2023-01-28 11:08:10,660 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (or (< (select .cse0 c_~A~0.offset) c_~min2~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse1 (select .cse0 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))))) (or (<= c_~min2~0 .cse1) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0) (= .cse1 c_~min1~0))))))) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (let ((.cse2 (select .cse4 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (<= .cse2 .cse3) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0) (= .cse3 c_~min1~0)))) (<= c_~min2~0 .cse2))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (< (select .cse5 c_~A~0.offset) c_~min2~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0) (< (select .cse5 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))) c_~min2~0))))) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (let ((.cse7 (select .cse6 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (< (select .cse6 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))) .cse7) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0))) (<= c_~min2~0 .cse7) (= c_~min1~0 .cse7)))))) is different from false [2023-01-28 11:08:10,905 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (.cse8 (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (< (select .cse16 c_~A~0.offset) c_~min2~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0) (< (select .cse16 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))) c_~min2~0)))))) (and (or (<= c_~min1~0 .cse0) (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (let ((.cse2 (select .cse3 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse1 (select .cse3 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (= .cse1 .cse0) (<= .cse2 .cse1) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0)))) (<= c_~min2~0 .cse2))))) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (let ((.cse5 (select .cse4 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (< (select .cse4 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))) .cse5) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0))) (<= c_~min2~0 .cse5) (= .cse0 .cse5))))) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse6 (select .cse7 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))))) (or (<= c_~min2~0 .cse6) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (= .cse6 .cse0) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0)))) (< (select .cse7 c_~A~0.offset) c_~min2~0)))) (or (= c_~min2~0 .cse0) .cse8))) (or (< .cse0 c_~min1~0) (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (or (< (select .cse9 c_~A~0.offset) c_~min2~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse10 (select .cse9 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))))) (or (<= c_~min2~0 .cse10) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0) (= .cse10 c_~min1~0))))))) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (let ((.cse11 (select .cse13 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse12 (select .cse13 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (<= .cse11 .cse12) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0) (= .cse12 c_~min1~0)))) (<= c_~min2~0 .cse11))))) (or (= c_~min2~0 c_~min1~0) .cse8) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (let ((.cse15 (select .cse14 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (< (select .cse14 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))) .cse15) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0))) (<= c_~min2~0 .cse15) (= c_~min1~0 .cse15))))))))) is different from false [2023-01-28 11:08:11,302 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse25 (select |c_#memory_int| c_~A~0.base)) (.cse26 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse8 (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (< (select .cse27 c_~A~0.offset) c_~min2~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0) (< (select .cse27 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))) c_~min2~0))))) (.cse1 (select .cse25 (+ c_~A~0.offset .cse26 4)))) (let ((.cse0 (select .cse25 (+ c_~A~0.offset .cse26))) (.cse2 (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (let ((.cse19 (select .cse20 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse18 (select .cse20 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (= .cse18 .cse1) (<= .cse19 .cse18) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0)))) (<= c_~min2~0 .cse19))))) (or .cse8 (= c_~min2~0 .cse1)) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (let ((.cse21 (select .cse22 c_~A~0.offset))) (or (= .cse21 .cse1) (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (< (select .cse22 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))) .cse21) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0))) (<= c_~min2~0 .cse21))))) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse23 (select .cse24 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))))) (or (<= c_~min2~0 .cse23) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (= .cse23 .cse1) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0)))) (< (select .cse24 c_~A~0.offset) c_~min2~0))))))) (and (or (< .cse0 c_~min1~0) (and (or (<= c_~min1~0 .cse1) .cse2) (or (< .cse1 c_~min1~0) (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (or (< (select .cse3 c_~A~0.offset) c_~min2~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))))) (or (<= c_~min2~0 .cse4) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0) (= .cse4 c_~min1~0))))))) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (let ((.cse5 (select .cse7 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse6 (select .cse7 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (<= .cse5 .cse6) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0) (= .cse6 c_~min1~0)))) (<= c_~min2~0 .cse5))))) (or (= c_~min2~0 c_~min1~0) .cse8) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (let ((.cse10 (select .cse9 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (< (select .cse9 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))) .cse10) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0))) (<= c_~min2~0 .cse10) (= c_~min1~0 .cse10))))))))) (or (<= c_~min1~0 .cse0) (and (or (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (let ((.cse12 (select .cse13 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse11 (select .cse13 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (= .cse11 .cse0) (<= .cse12 .cse11) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0)))) (<= c_~min2~0 .cse12))))) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (let ((.cse15 (select .cse14 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (< (select .cse14 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))) .cse15) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0))) (<= c_~min2~0 .cse15) (= .cse0 .cse15))))) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1108) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_111 Int)) (let ((.cse16 (select .cse17 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_111 4))))) (or (<= c_~min2~0 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_111) (= .cse16 .cse0) (< (+ v_thread3Thread1of1ForFork0_~i~2_111 1) c_~N~0)))) (< (select .cse17 c_~A~0.offset) c_~min2~0)))) (or (= c_~min2~0 .cse0) .cse8)) (< .cse1 .cse0)) (or (<= .cse0 .cse1) .cse2))))))) is different from false [2023-01-28 11:08:41,101 WARN L222 SmtUtils]: Spent 26.82s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:08:41,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:08:41,471 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 185 treesize of output 113 [2023-01-28 11:08:41,533 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-01-28 11:08:41,533 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 2742 treesize of output 2423 [2023-01-28 11:08:41,609 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:08:41,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:08:41,626 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 296 treesize of output 266 [2023-01-28 11:08:41,656 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 11:08:41,664 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 376 treesize of output 312 [2023-01-28 11:08:41,697 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 11:08:41,698 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 171 treesize of output 139 [2023-01-28 11:08:42,757 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:08:42,758 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-28 11:08:42,803 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-01-28 11:08:42,803 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 1734 treesize of output 1655 [2023-01-28 11:08:42,844 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:08:42,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 156 [2023-01-28 11:08:42,863 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:08:42,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:08:42,874 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 176 treesize of output 164 [2023-01-28 11:08:42,903 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 11:08:42,903 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 139 [2023-01-28 11:08:43,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:08:43,249 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 181 treesize of output 109 [2023-01-28 11:08:43,291 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-01-28 11:08:43,291 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 1250 treesize of output 1103 [2023-01-28 11:08:43,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:08:43,341 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 176 treesize of output 130 [2023-01-28 11:08:43,356 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:08:43,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:08:43,359 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 163 [2023-01-28 11:08:43,385 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:08:43,385 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 143 [2023-01-28 11:08:43,682 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 11:08:43,683 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 179 treesize of output 1 [2023-01-28 11:08:43,699 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 11:08:43,699 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 160 treesize of output 1 [2023-01-28 11:08:43,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:08:43,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 88 [2023-01-28 11:08:43,730 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:08:43,730 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:08:43,764 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:08:43,765 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 110 [2023-01-28 11:08:43,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:08:43,807 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-28 11:08:43,956 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 11:08:43,956 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 177 treesize of output 1 [2023-01-28 11:08:43,982 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 11:08:43,982 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 204 treesize of output 1 [2023-01-28 11:08:44,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:08:44,003 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 200 treesize of output 116 [2023-01-28 11:08:44,013 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:08:44,013 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:08:44,053 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-01-28 11:08:44,053 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 182 treesize of output 139 [2023-01-28 11:08:44,081 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-28 11:08:44,081 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 60 treesize of output 40 [2023-01-28 11:08:44,125 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 11:08:44,126 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 164 treesize of output 1 [2023-01-28 11:08:44,144 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 11:08:44,144 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-28 11:08:44,165 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 11:08:44,165 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 198 treesize of output 1 [2023-01-28 11:08:44,183 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 11:08:44,183 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-28 11:08:44,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:08:44,204 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-28 11:08:44,214 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:08:44,215 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:08:44,241 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-28 11:08:44,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 97 treesize of output 79 [2023-01-28 11:08:44,274 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-01-28 11:08:44,275 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-28 11:08:44,325 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 11:08:44,325 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 202 treesize of output 1 [2023-01-28 11:08:44,342 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 11:08:44,343 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 160 treesize of output 1 [2023-01-28 11:08:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-01-28 11:08:44,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188068781] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:08:44,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:08:44,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 39 [2023-01-28 11:08:44,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134865485] [2023-01-28 11:08:44,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:08:44,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-01-28 11:08:44,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:08:44,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-01-28 11:08:44,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1193, Unknown=7, NotChecked=292, Total=1640 [2023-01-28 11:08:44,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 273 [2023-01-28 11:08:44,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 615 transitions, 10313 flow. Second operand has 41 states, 41 states have (on average 70.85365853658537) internal successors, (2905), 41 states have internal predecessors, (2905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:08:44,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:08:44,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 273 [2023-01-28 11:08:44,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:08:59,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:09:02,038 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-28 11:09:04,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:09:07,875 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-28 11:09:19,799 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-28 11:09:22,822 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-28 11:09:25,576 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-28 11:09:28,636 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-28 11:09:33,213 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-28 11:09:39,490 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-28 11:09:42,530 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-28 11:09:44,851 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-28 11:09:48,148 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-28 11:09:53,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:09:57,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:10:00,272 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-28 11:10:02,804 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-28 11:10:05,515 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-28 11:10:07,967 INFO L130 PetriNetUnfolder]: 4821/7090 cut-off events. [2023-01-28 11:10:07,968 INFO L131 PetriNetUnfolder]: For 99251/99251 co-relation queries the response was YES. [2023-01-28 11:10:08,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62613 conditions, 7090 events. 4821/7090 cut-off events. For 99251/99251 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 36931 event pairs, 255 based on Foata normal form. 7/7097 useless extension candidates. Maximal degree in co-relation 62540. Up to 5348 conditions per place. [2023-01-28 11:10:08,034 INFO L137 encePairwiseOnDemand]: 260/273 looper letters, 787 selfloop transitions, 306 changer transitions 13/1106 dead transitions. [2023-01-28 11:10:08,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 1106 transitions, 19513 flow [2023-01-28 11:10:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-01-28 11:10:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-01-28 11:10:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2824 transitions. [2023-01-28 11:10:08,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28734228734228734 [2023-01-28 11:10:08,038 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 2824 transitions. [2023-01-28 11:10:08,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 2824 transitions. [2023-01-28 11:10:08,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:10:08,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 2824 transitions. [2023-01-28 11:10:08,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 78.44444444444444) internal successors, (2824), 36 states have internal predecessors, (2824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:10:08,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 273.0) internal successors, (10101), 37 states have internal predecessors, (10101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:10:08,049 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 273.0) internal successors, (10101), 37 states have internal predecessors, (10101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:10:08,049 INFO L175 Difference]: Start difference. First operand has 246 places, 615 transitions, 10313 flow. Second operand 36 states and 2824 transitions. [2023-01-28 11:10:08,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 1106 transitions, 19513 flow [2023-01-28 11:10:08,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 1106 transitions, 18535 flow, removed 8 selfloop flow, removed 16 redundant places. [2023-01-28 11:10:08,759 INFO L231 Difference]: Finished difference. Result has 283 places, 883 transitions, 15518 flow [2023-01-28 11:10:08,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=9623, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=15518, PETRI_PLACES=283, PETRI_TRANSITIONS=883} [2023-01-28 11:10:08,760 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 253 predicate places. [2023-01-28 11:10:08,761 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 883 transitions, 15518 flow [2023-01-28 11:10:08,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 70.85365853658537) internal successors, (2905), 41 states have internal predecessors, (2905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 11:10:08,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:10:08,761 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-28 11:10:08,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-01-28 11:10:08,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:10:08,967 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:10:08,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:10:08,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1166690535, now seen corresponding path program 4 times [2023-01-28 11:10:08,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:10:08,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139137027] [2023-01-28 11:10:08,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:10:08,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:10:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:10:10,471 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-28 11:10:10,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:10:10,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139137027] [2023-01-28 11:10:10,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139137027] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:10:10,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981052754] [2023-01-28 11:10:10,471 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 11:10:10,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:10:10,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:10:10,472 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:10:10,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-01-28 11:10:10,579 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 11:10:10,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:10:10,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 11:10:10,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:10:11,757 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:10:11,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:10:11,765 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:10:11,765 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 147 treesize of output 76 [2023-01-28 11:10:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:10:12,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:10:14,596 INFO L321 Elim1Store]: treesize reduction 10, result has 96.6 percent of original size [2023-01-28 11:10:14,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 381 treesize of output 443 [2023-01-28 11:11:58,391 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:12:09,844 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:12:19,651 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:12:52,664 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:12:57,720 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:13:05,709 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:13:13,927 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:13:29,085 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:13:30,219 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:13:48,089 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:14:14,686 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:14:32,478 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-28 11:15:03,142 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-01-28 11:15:36,269 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:15:48,348 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:16:06,429 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:16:58,662 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:19:10,232 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-28 11:19:35,258 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. Received shutdown request... [2023-01-28 11:20:35,626 WARN L238 SmtUtils]: Removed 2 from assertion stack [2023-01-28 11:20:35,628 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 11:20:35,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-01-28 11:20:35,644 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 11:20:35,652 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 11:20:35,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-01-28 11:20:35,828 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 7ms.. [2023-01-28 11:20:35,829 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-01-28 11:20:35,830 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-01-28 11:20:35,830 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-01-28 11:20:35,830 INFO L445 BasicCegarLoop]: Path program histogram: [19, 4, 1, 1, 1] [2023-01-28 11:20:35,832 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 11:20:35,832 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 11:20:35,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:20:35 BasicIcfg [2023-01-28 11:20:35,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 11:20:35,835 INFO L158 Benchmark]: Toolchain (without parser) took 830863.54ms. Allocated memory was 337.6MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 284.2MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 4.1GB. Max. memory is 16.0GB. [2023-01-28 11:20:35,835 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 11:20:35,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.33ms. Allocated memory is still 337.6MB. Free memory was 283.9MB in the beginning and 272.5MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-28 11:20:35,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.97ms. Allocated memory is still 337.6MB. Free memory was 272.5MB in the beginning and 270.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 11:20:35,836 INFO L158 Benchmark]: Boogie Preprocessor took 30.07ms. Allocated memory is still 337.6MB. Free memory was 270.7MB in the beginning and 269.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 11:20:35,836 INFO L158 Benchmark]: RCFGBuilder took 534.13ms. Allocated memory is still 337.6MB. Free memory was 269.0MB in the beginning and 295.4MB in the end (delta: -26.4MB). Peak memory consumption was 8.5MB. Max. memory is 16.0GB. [2023-01-28 11:20:35,836 INFO L158 Benchmark]: TraceAbstraction took 830031.27ms. Allocated memory was 337.6MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 294.8MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 4.1GB. Max. memory is 16.0GB. [2023-01-28 11:20:35,837 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.11ms. Allocated memory is still 255.9MB. Free memory is still 213.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 223.33ms. Allocated memory is still 337.6MB. Free memory was 283.9MB in the beginning and 272.5MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.97ms. Allocated memory is still 337.6MB. Free memory was 272.5MB in the beginning and 270.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.07ms. Allocated memory is still 337.6MB. Free memory was 270.7MB in the beginning and 269.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 534.13ms. Allocated memory is still 337.6MB. Free memory was 269.0MB in the beginning and 295.4MB in the end (delta: -26.4MB). Peak memory consumption was 8.5MB. Max. memory is 16.0GB. * TraceAbstraction took 830031.27ms. Allocated memory was 337.6MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 294.8MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 4.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 129 PlacesBefore, 30 PlacesAfterwards, 131 TransitionsBefore, 24 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 8 FixpointIterations, 73 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 15 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 129 TotalNumberOfCompositions, 1615 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1511, independent: 1489, independent conditional: 0, independent unconditional: 1489, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 724, independent: 714, independent conditional: 0, independent unconditional: 714, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1511, independent: 775, independent conditional: 0, independent unconditional: 775, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 724, unknown conditional: 0, unknown unconditional: 724] , 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 CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 7ms.. - 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 CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 7ms.. - 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 CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 7ms.. - 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 CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 7ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 163 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: 829.9s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.0s, AutomataDifference: 135.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 364 mSolverCounterUnknown, 4349 SdHoareTripleChecker+Valid, 68.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4349 mSDsluCounter, 975 SdHoareTripleChecker+Invalid, 66.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2610 IncrementalHoareTripleChecker+Unchecked, 855 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16067 IncrementalHoareTripleChecker+Invalid, 19265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 120 mSDtfsCounter, 16067 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1564 GetRequests, 806 SyntacticMatches, 46 SemanticMatches, 712 ConstructedPredicates, 9 IntricatePredicates, 3 DeprecatedPredicates, 5798 ImplicationChecksByTransitivity, 78.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15518occurred in iteration=25, InterpolantAutomatonStates: 407, 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.3s SatisfiabilityAnalysisTime, 55.0s InterpolantComputationTime, 1149 NumberOfCodeBlocks, 1143 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 1632 ConstructedInterpolants, 34 QuantifiedInterpolants, 25012 SizeOfPredicates, 250 NumberOfNonLiveVariables, 5040 ConjunctsInSsa, 435 ConjunctsInUnsatCore, 71 InterpolantComputations, 3 PerfectInterpolantSequences, 165/352 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